Initial Upload

The main upload to the repo

Author: aryanagrawal2911

ArrayList_Basics.java

@@ -0,0 +1,37 @@
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class ArrayList_Basics {
+    static Scanner sn = new Scanner(System.in);
+
+    static void display(ArrayList<Integer> arrl) {
+        if (arrl.isEmpty())
+            return;
+
+        System.out.println("Array : " + arrl);
+    }
+
+    static boolean Search(ArrayList<Integer> arrl) {
+        if (arrl.isEmpty())
+            return false;
+
+        System.out.println("Enter the value to be searched : ");
+        int x = sn.nextInt();
+        return arrl.contains(x);
+    }
+
+    static void remove(ArrayList<Integer> arrl, int index) {
+        if (arrl.isEmpty())
+            return;
+
+        if (arrl.contains(arrl.get(index)))
+            arrl.remove(index);
+
+        else {
+            System.out.println("Confirm Input Element");
+            return;
+        }
+
+    }
+
+}

Arrays_Basics.java

@@ -0,0 +1,102 @@
+import java.util.Scanner;
+
+public class Arrays_Basics {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+		// set of multiple objects
+		int[] marks = { 100, 65, 78, 21, 77 };
+
+		for (int i = 0; i < marks.length; i++) {
+			System.out.print(i + "\t");
+			System.out.println(marks[i]);
+		}
+
+		for (int i = marks.length - 1; i >= 0; i--) {
+			System.out.print(i + "\t");
+			System.out.println(marks[i]);
+		}
+
+		for (int i : marks) {
+			System.out.print(i + "\t");
+		}
+
+		int[][] a = new int[2][3];
+		a[0][0] = 101;
+		a[0][1] = 102;
+		a[0][2] = 103;
+		a[1][0] = 201;
+		a[1][1] = 202;
+		a[1][2] = 203;
+
+		for (int i = 0; i < a.length; i++) {
+			for (int j = 0; j < a[i].length; j++) {
+				System.out.print(a[i][j] + "\t");
+			}
+
+		}
+
+		// 1.
+		float[] fl = { 5.78f, 67, 33.8f, 22, 90.9f };
+		float f = 0;
+		for (int i = 0; i < fl.length; i++) {
+			f += fl[i];
+		}
+		System.out.println(f);
+
+		// 2.
+		Scanner sn = new Scanner(System.in);
+		double n = sn.nextDouble();
+		double[] ab = { 78, 69.887, 56.75, 76.83, 93.5, 63.42, 65.2 };
+		for (int i = 0; i < ab.length; i++) {
+			if (ab[i] != n) {
+				continue;
+			} else {
+				System.out.println("location is : " + i);
+				break;
+			}
+		}
+		sn.close();
+
+		// 3.
+		double[] ac = { 78, 69.8, 56.75, 76.8, 93.5, 63.42, 65.2, 98.5 };
+		double s = 0;
+		for (int i = 0; i < ac.length; i++) {
+			s += ac[i];
+		}
+		s /= a.length;
+		System.out.println(s);
+
+		// 4.
+		double[][] m1 = new double[2][3];
+		double[][] m2 = new double[2][3];
+
+		for (int i = 0; i < m1.length; i++) {
+			for (int j = 0; j < m1[i].length; j++) {
+				m1[i][j] = sn.nextDouble();
+				m2[i][j] = sn.nextDouble();
+			}
+		}
+		sn.close();
+
+		// 5. The system will swear at you if you execute this command
+		String[] arr = { "u", " ", "k", "c", "u", "f" };
+		for (int i = arr.length - 1; i >= 0; i--) {
+			System.out.print(arr[i]);
+		}
+		// told you so
+
+		// 6. , 7.
+		int[] ar = { 76, 65, 78, 21, 77 };
+		int max = 0;
+		int min = Integer.MAX_VALUE;
+		for (int i = 0; i < ar.length; i++) {
+			max = Math.max(ar[i], max);
+			min = Math.min(ar[i], min);
+		}
+		System.out.println("Maximum = " + max);
+		System.out.println("Minimum = " + min);
+
+	}
+}

Basic_Datacleaning.java

@@ -0,0 +1,33 @@
+import java.io.*;
+
+public class Basic_Datacleaning {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		try {
+			FileReader fr = new FileReader("C:\\Users\\hp\\Downloads\\[CSE3141] Attendance - Sheet1 (1).csv");
+			FileWriter fw = new FileWriter("C:\\Users\\hp\\Desktop\\Untitled.txt");
+			BufferedReader br = new BufferedReader(fr);
+			BufferedWriter bw = new BufferedWriter(fw);
+
+			String line = br.readLine();
+			while (line != null) {
+				String ans[] = line.split(",+", 0);
+				String res = ans[0];
+				for (int i = 1; i < ans.length - 2; i++) {
+					res = res + "," + ans[i];
+				}
+				System.out.println(res);
+				bw.write(res + "\n");
+				line = br.readLine();
+			}
+			fr.close();
+			bw.close();
+			// System.out.println("File Copied");
+		} catch (IOException e) {
+			System.out.println("Error");
+			e.printStackTrace();
+		}
+	}
+
+}

Basic_FILE_HADLING.java

@@ -0,0 +1,28 @@
+import java.io.*;
+
+public class Basic_FILE_HADLING {
+  public static void main(String args[]) throws IOException {
+    File fileName = new File("C:\\Users\\hp\\Downloads\\[CSE3141] Attendance - Sheet1 (1).csv");
+
+    FileInputStream inFile = new FileInputStream("C:\\Users\\hp\\Downloads\\[CSE3141] Attendance - Sheet1 (1).csv");
+    int fileLength = (int) fileName.length();
+
+    byte Bytes[] = new byte[fileLength];
+
+    System.out.println("File size is: " + inFile.read(Bytes));
+
+    String file1 = new String(Bytes);
+    System.out.println("File content is:\n" + file1);
+
+    FileOutputStream outFile = new FileOutputStream("C:\\Users\\hp\\Desktop\\Untitled.txt");
+
+    for (int i = 0; i < fileLength; i++) {
+      outFile.write(Bytes[i]);
+    }
+
+    System.out.println("File copied.");
+    // close files
+    inFile.close();
+    outFile.close();
+  }
+}

Binary_Search_in_Array.java

@@ -0,0 +1,32 @@
+public class Binary_Search_in_Array {
+    static int binsch(int arr[], int l, int r, int x) {
+
+        if (r >= 1) {
+
+            int m = l + (r - 1) / 2;
+
+            if (x == arr[m])
+                return m;
+
+            if (x < arr[m])
+                return binsch(arr, l, m - 1, x);
+
+            return binsch(arr, m + 1, r, x);
+        }
+
+        return -1;
+    }
+
+    public static void main(String args[]) {
+        int arr[] = { 2, 3, 4, 10, 40 };
+        int n = arr.length;
+        int x = 10;
+        int result = binsch(arr, 0, n - 1, x);
+
+        if (result == -1)
+            System.out.println("Element is not present in array");
+
+        else
+            System.out.println("Element is present at index : " + result);
+    }
+}

Decimal_to_Binary_ONE_LINER.java

@@ -0,0 +1,7 @@
+public class Decimal_to_Binary_ONE_LINER {
+
+    public static void main(String[] args) {
+
+        System.out.println(Integer.toBinaryString(20));
+    }
+}

Decimal_to_Binary_STACK.java

@@ -0,0 +1,20 @@
+import java.util.Stack;
+
+public class Decimal_to_Binary_STACK {
+    static void stackBin(int x) {
+        Stack<Integer> s = new Stack<>();
+
+        while (x > 0) {
+            int r = x % 2;
+            s.push(r);
+            x /= 2;
+        }
+
+        while (!s.isEmpty())
+            System.out.print(s.pop());
+    }
+
+    public static void main(String[] args) {
+        stackBin(29);
+    }
+}

Distance_TwoPoints.java

@@ -0,0 +1,53 @@
+import java.util.Scanner;
+
+class Point {
+	float x, y;
+
+	void setPoint(float x1, float y1) {
+		x = x1;
+		y = y1;
+	}
+
+	void showPoint() {
+		System.out.println("(" + x + "," + y + ")");
+	}
+
+	double findDistance(Point p) {
+		double f = Math.sqrt((Math.pow((p.x - x), 2)) + (Math.pow((p.y - y), 2)));
+		return f;
+	}
+}
+
+class Distance_TwoPoints {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+
+		Point a = new Point();
+		System.out.println("Enter the coordinates for point 1:");
+
+		float k = in.nextFloat();
+		float l = in.nextFloat();
+		a.setPoint(k, l);
+
+		System.out.print("Point 1 is:");
+		a.showPoint();
+
+		Point b = new Point();
+		System.out.println("Enter the coordinates for point 2:");
+
+		int k1 = in.nextInt();
+		int l1 = in.nextInt();
+		b.setPoint(k1, l1);
+
+		System.out.print("Point 2 is:");
+		b.showPoint();
+
+		double d = a.findDistance(b);
+		System.out.print("Distance between point 1 and point 2 is approximately: " + d);
+		in.close();
+
+	}
+
+}

GCD_of_TWO_numbers.java

@@ -0,0 +1,22 @@
+public class GCD_of_TWO_numbers {
+
+    static int Gcd(int a, int b) {
+
+        if (b > a)
+            return Gcd(b, a);
+
+        if (a % b == 0)
+            return b;
+
+        if (a == 0)
+            return b;
+        if (b == 0)
+            return a;
+
+        return Gcd(b, a % b);
+    }
+
+    public static void main(String[] args) {
+        System.out.println(Gcd(81, 108));
+    }
+}

Graph_BFS_Traversal.java

@@ -0,0 +1,33 @@
+import java.util.ArrayDeque;
+
+public class Graph_BFS_Traversal {
+
+	static void TraversalBFS(int gra[][]) {
+
+		ArrayDeque<Integer> ad = new ArrayDeque<>();
+		boolean visited[] = new boolean[gra.length];
+
+		ad.add(0);
+		visited[0] = true;
+
+		while (!ad.isEmpty()) {
+
+			int u = ad.poll();
+			System.out.print(u + " ");
+
+			for (int j = 0; j < gra[u].length; j++) {
+
+				if (gra[u][j] == 1 && !visited[j]) {
+					ad.add(j);
+					visited[j] = true;
+				}
+			}
+		}
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}