new folders added for program

Author: amangit1314

CollectionFramework/List.java

@@ -0,0 +1,14 @@
+package CollectionFramework;
+
+import java.util.LinkedList;
+public class List{
+		public static void main(String[] args) {
+
+			LinkedList<String> ll = new LinkedList<>();  
+				    
+			ll.add("Aman");  
+			ll.add("Soni");  
+			ll.add(1, "Kumar");  
+			System.out.println(ll);  
+		} 
+}

arrays/BasicArrays.java

@@ -0,0 +1,33 @@
+package arrays;
+
+import java.io.*;
+
+public class BasicArrays {
+
+	public static void main(String[] args) {
+		
+		int a[];
+		a = new int[5];
+		
+		try {
+			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+			for(int i=0;i<5;i++) {
+				int j=i+1;
+				System.out.println(" Enter element no." +j);
+				String s = br.readLine();
+				a[i] = Integer.parseInt(s);
+			}
+			for(int i=0;i<5;i++) {
+			System.out.println("arr["+i+"]="+a[i]);
+			}
+		}
+		
+		catch(Exception e) {
+			System.out.println(""+e);
+		}
+	}
+}
+		
+		
+
+

arrays/FIndDublicate.java

@@ -0,0 +1,32 @@
+package arrays;
+
+public class FIndDublicate {
+	// Implementing an array as a HashMap for finding duplicate elements	
+				void printRepeating(int m[],int size) {
+					
+					int i;
+					System.out.print("The repeating elements are:");
+					
+					for(i=0;i<size;i++) {
+						
+						// using Math.abs() function to find the duplicate element in HashMap.
+						
+						if(m[Math.abs(m[i])]>=0)	m[Math.abs(m[i])] = -m[Math.abs(m[i])];
+						else						System.out.print(Math.abs(m[i]) + " ");
+					}
+				}
+				
+				//Driver Method
+				public static void main(String[] args) {
+					
+					FIndDublicate dublicate= new FIndDublicate();			// Making an object of FindDuplicate class
+					
+					int m[] = {1,2,3,1,3,6,6};								// Putting or declare values in or to array
+					int m_size = m.length;									// variables which store size or length of array
+					
+					dublicate.printRepeating(m,m_size);						// calling above function to pass value in it to print repeating elements
+					
+				}
+
+}
+

arrays/package-info.java

@@ -0,0 +1 @@
+package arrays;

basics/ControlStatements.java

@@ -0,0 +1,31 @@
+package basics;
+// public class to implement or for run the code
+public class ControlStatements {
+
+	public static void main(String[] args) {
+		// for loop to implement switch case statement
+		for(int i =0;i<9;i++){
+			// switch controle statement
+		switch(i) {
+		// case1
+		case 1: 
+			System.out.println(" i is zero.");
+			break;		//break statement
+			//case2
+		case 2:
+			System.out.println(" i is one.");
+			break;
+			//case3
+		case 3:
+			System.out.println(" i is zero.");
+			break;
+		default: //default statement
+			System.out.println(" i is greater than 3.");
+	
+		}
+		
+		}
+	}
+}
+
+

basics/DoWhileLoop.java

@@ -0,0 +1,15 @@
+package basics;
+
+public class DoWhileLoop {
+	//method inside which do while loop will occur
+	public static void main(String[] args) {
+		
+	int n = 10;
+	//do while loop's do block
+	// must executes atleast once
+		do {
+			System.out.println(" tick " +n);
+			n--;
+		}while(n>0);// do while loop's while block
+	}	// end of main method
+}// end of class

basics/Operators.java

@@ -0,0 +1,17 @@
+package basics;
+
+public class Operators {
+
+	public static void main(String[] args) {
+		int a = 7,b= 6;
+		int c = a*b;    //* (multiplication) operator
+		int d = a+b;	// + addition operator
+		int e = a/b;	// - substration operator
+		int f = a%b;	// % modulus operator
+		int g = a^b;	// ^ power operator
+		long h = b^a;
+		System.out.println(c + " " + d + " " + e + " " + f + " " + g + " " + h);
+
+	}
+
+}

basics/Treedatastructure.java

@@ -0,0 +1,65 @@
+package basics;
+
+// a node class
+class Node{
+	int key ;
+	Node left,right;
+	public Node(int item) {
+		key = item;
+		left = right = null;
+	}
+}
+
+class Treedatastructure{ 
+    // Root of Binary Tree 
+    Node root; 
+  
+    // Constructors 
+    Treedatastructure(int key) 
+    { 
+        root = new Node(key); 
+    } 
+  
+    Treedatastructure() 
+    { 
+        root = null; 
+    } 
+  
+    public static void main(String[] args) 
+    { 
+        Treedatastructure tree = new Treedatastructure(); 
+  
+        /*create root*/
+        tree.root = new Node(1); 
+  
+        /* following is the tree after above statement 
+  
+              1 
+            /   \ 
+          null  null     */
+  
+        tree.root.left = new Node(2); 
+        tree.root.right = new Node(3); 
+  
+        /* 2 and 3 become left and right children of 1 
+               1 
+             /   \ 
+            2      3 
+          /    \    /  \ 
+        null null null null  */
+  
+  
+         tree.root.left.left = new Node(4); 
+        /* 4 becomes left child of 2 
+                    1 
+                /       \ 
+               2          3 
+             /   \       /  \ 
+            4    null  null  null 
+           /   \ 
+          null null 
+         */
+         
+    }}
+
+

basics/VariablesandDataTypes.java

@@ -0,0 +1,15 @@
+package basics;
+
+public class VariablesandDataTypes {
+
+	public static void main(String[] args) {
+		
+		int age = 18;   		// integer data type
+		String name = "Aman";   // String data type
+		long number = 7023;     // long data type
+		String address ="Behind Fort";
+		System.out.println(age +  " " + name + " " +  number +  " " + address);
+		
+	}
+
+}

basics/WhileLoop.java

@@ -0,0 +1,16 @@
+package basics;
+
+public class WhileLoop {
+
+	public static void main(String[] args) {
+		
+		int n = 5;
+		// while loop block
+			while(n>0) {
+				System.out.println(" tick " + n);
+				n--;								// post substraction operator
+			}
+			
+		}
+		
+	}