update

Author: kevinobama

src/kevinCollection/CollectionsDemo.java

@@ -0,0 +1,50 @@
+package kevinCollection;
+
+import java.util.*;
+
+public class CollectionsDemo {
+
+	public static void main(String[] args) {
+	      // ArrayList 
+		//exampleOne();		
+	}
+	
+	public static void exampleOne() {
+	      // ArrayList 
+	      List a1 = new ArrayList();
+	      a1.add("Zara");
+	      a1.add("Mahnaz");
+	      a1.add("Ayan");
+	      System.out.println(" ArrayList Elements");
+	      System.out.print("\t" + a1);
+
+	      // LinkedList
+	      List l1 = new LinkedList();
+	      l1.add("Zara");
+	      l1.add("Mahnaz");
+	      l1.add("Ayan");
+	      System.out.println();
+	      System.out.println(" LinkedList Elements");
+	      System.out.print("\t" + l1);
+
+	      // HashSet
+	      Set s1 = new HashSet(); 
+	      s1.add("Zara");
+	      s1.add("Mahnaz");
+	      s1.add("Ayan");
+	      
+	      System.out.println();
+	      System.out.println(" Set Elements");
+	      System.out.print("\t" + s1);
+
+	      // HashMap
+	      Map m1 = new HashMap(); 
+	      m1.put("Zara", "8");
+	      m1.put("Mahnaz", "31");
+	      m1.put("Ayan", "12");
+	      m1.put("Daisy", "14");
+	      System.out.println();
+	      System.out.println(" Map Elements");
+	      System.out.print("\t" + m1);
+	   }
+}

src/kevinCollection/HashMapExample.java

@@ -0,0 +1,21 @@
+package kevinCollection;
+
+import java.util.Map;
+import java.util.HashMap;
+
+public class HashMapExample {
+
+ public static void main(String[] args) {
+      Map m1 = new HashMap(); 
+      m1.put("Zara", "8");
+      m1.put("Mahnaz", "31");
+      m1.put("Ayan", "12");
+      m1.put("Daisy", "14");
+      m1.put("gates", "70");
+
+      System.out.println();
+      System.out.println(" Map Elements");
+      System.out.print("\t" + m1);
+      System.out.print("\t" + m1.get("gates"));
+   }
+}

src/kevinCollection/ListExample.java

@@ -0,0 +1,40 @@
+package kevinCollection;
+
+import java.util.*;
+
+/**
+ * An ordered collection (also known as a sequence). The user of this interface has precise control over where in the list each element is inserted. The user can access elements by their integer index (position in the list), and search for elements in the list.
+Set<E>:
+
+A collection that contains no duplicate elements. More formally, sets contain no pair of elements e1 and e2 such that e1.equals(e2), and at most one null element. As implied by its name, this interface models the mathematical set abstraction.
+ * @author kevingates
+ *
+ */
+public class ListExample {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Example1();
+	}
+	
+	public static void Example1() {
+	      List a1 = new ArrayList();
+	      a1.add("one");
+	      a1.add("two");
+	      a1.add("three");
+	      a1.add(33);
+	      a1.add("two");
+	      a1.add("two");
+	      System.out.println(" ArrayList Elements");
+	      System.out.print("\t" + a1);
+
+	      List l1 = new LinkedList();
+	      l1.add("Zara");
+	      l1.add("Mahnaz");
+	      l1.add("Ayan");
+	      System.out.println();
+	      System.out.println(" LinkedList Elements");
+	      System.out.print("\t" + l1);
+	}
+
+}

src/kevinCollection/SetExample.java

@@ -0,0 +1,48 @@
+package kevinCollection;
+//import java.util.*;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.*;
+
+public class SetExample {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		setString();
+	}
+	
+	public static void setInteger() {
+		Set<Integer> a = new HashSet<Integer>();
+        a.addAll(Arrays.asList(new Integer[] {1, 3, 2, 4, 8, 9, 0}));
+        
+        Set<Integer> b = new HashSet<Integer>();
+        b.addAll(Arrays.asList(new Integer[] {1, 3, 7, 5, 4, 0, 7, 5}));
+ 
+        // To find union
+        Set<Integer> union = new HashSet<Integer>(a);
+        union.addAll(b);
+        System.out.print("Union of the two Set");
+        System.out.println(union);
+ 
+
+	}
+	
+	public static void setString() {
+		// TODO Auto-generated method stub
+		Set<String> hash_Set = new HashSet<String>();
+        hash_Set.add("Geeks");
+        hash_Set.add("For");
+        hash_Set.add("Geeks");
+        hash_Set.add("Example");
+        hash_Set.add("Set");
+        System.out.print("Set output without the duplicates");
+ 
+        System.out.println(hash_Set);
+ 
+        // Set deonstration using TreeSet
+        System.out.print("Sorted Set after passing into TreeSet");
+        Set<String> tree_Set = new TreeSet<String>(hash_Set);
+        System.out.println(tree_Set);
+	}	
+}

src/kevinCollection/SetExample1.java

@@ -0,0 +1,46 @@
+package kevinCollection;
+//import java.util.*;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.*;
+
+public class SetExample1 {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		setString();
+	}
+	
+	public static void setInteger() {
+		Set<Integer> a = new HashSet<Integer>();
+        a.addAll(Arrays.asList(new Integer[] {1, 3, 2, 4, 8, 9, 0}));
+        
+        Set<Integer> b = new HashSet<Integer>();
+        b.addAll(Arrays.asList(new Integer[] {1, 3, 7, 5, 4, 0, 7, 5}));
+ 
+        // To find union
+        Set<Integer> union = new HashSet<Integer>(a);
+        union.addAll(b);
+        System.out.print("Union of the two Set");
+        System.out.println(union);
+ 
+	}
+	
+	public static void setString() {
+		// TODO Auto-generated method stub
+		Set<String> hash_Set = new HashSet<String>();
+        hash_Set.add("one");
+        hash_Set.add("two");
+        hash_Set.add("three");
+        hash_Set.add("four");
+        hash_Set.add("four");
+        System.out.print("Set output without the duplicates");
+        System.out.println(hash_Set);
+ 
+        // Set deonstration using TreeSet
+        System.out.print("Sorted Set after passing into TreeSet");
+        Set<String> tree_Set = new TreeSet<String>(hash_Set);
+        System.out.println(tree_Set);
+	}	
+}

src/kevinGates/GenericMethodTest.java

@@ -25,4 +25,4 @@ public static void main(String args[]) {
       System.out.println("\nArray characterArray contains:");
       printArray(charArray);   // pass a Character array
    }
-}
+}

src/kevinGates/UserImplementInterface.java

@@ -13,15 +13,15 @@ public static void main(String[] args) {
 		System.out.println("data="+user.data());
 	}
 
-//	public void insert() {
-//		
-//	}
-//	
-//	public void update() {
-//		
-//	}
-//	
-//	public void delete() {
-//		
-//	}	
+	public void insert() {
+		System.out.println("data=");
+	}
+	
+	public void update() {
+		System.out.println("data=");
+	}
+	
+	public void delete() {
+		System.out.println("data=");
+	}	
 }