26 Collection Framework Practising Programs PDF
26 Collection Framework Practising Programs PDF
4. Which defines a method called nextElement that is used to get the next element in a data
structure that contains multiple elements?
/*
Options
A) Bitset
B) Vector
C) Stack
D) Enumeration
*/
/*
Options
A) Maps
B) Array
C) Stack
D) Queue
*/
7. Which of these methods deletes all the elements from invoking collection?
/*
Options
A) clear()
B) reset()
C) delete()
D) refresh()
*/
10. Which of these methods sets every element of a List to a specified object?
/*
Options
A) set()
B) fill()
C) Complete()
D) add()
*/
*/
13. Which interface provides the capability to store objects using a key-value pair?
/*
Options
A) Java.util.Map
B) Java.util.Set
C) Java.util.List
D) Java.util.Collection
*/
Collection Programs
1. How to copy or clone an ArrayList?
2. How to find does ArrayList contains all list elements or not?
3. How to reverse ArrayList elements.
4. How to shuffle elements in ArrayList?
5. Program to copy ArrayList elements into Array object.
6. Program to copy LinkedList elements into Array object.
7. Program to get First and Last elements from LinkedList.
8. Program to iterate LinkedList elements in reverse order.
9. Program to copy one Set elements to another Set.
10. Program to compare and retain elements of two Set Objects.
11. Program to copy Map elements to another Map.
12. Program to find key in HashMap.
13. Program to find value in HashMap.
14. Program to get all the key from HashMap.
15. Program to convert Array into List.
16. Program to remove duplicates from an Array.
17. Program to find duplicate from an Array.
18. Program to find largest and smallest element from ArrayList.
import java.util.ArrayList;
Output:
Actual ArrayList: [Samba, Dinga, Bunga, Manga]
Cloned ArrayList: [Samba, Dinga, Bunga, Manga]
import java.util.ArrayList;
import java.util.List;
System.out.println("-------------------------------------------------");
arr2.add("Manga");
System.out.println("Does arr1 contains all arr2 elements?");
System.out.println("arr1: "+arr1);
System.out.println("arr2: "+arr2);
System.out.println(arr1.containsAll(arr2));
}
}
Output:
Does arr1 contains all arr2 elements?
arr1: [Samba, Dinga, Bunga, Ranga]
arr2: [Samba, Dinga]
true
-------------------------------------------------
Does arr1 contains all arr2 elements?
arr1: [Samba, Dinga, Bunga, Ranga]
arr2: [Samba, Dinga, Manga]
false
import java.util.ArrayList;
Iterator it = arr.itrator();
While(it.hasNext())
{
System.out.println(it.next());
}
Collections.reverse(arr);
System.out.println("Reversed ArrayList content:");
it = arr.itrator();
While(it.hasNext())
{
System.out.println(it.next());
}
}
}
Output:
Actual ArrayList:
Samba
Dinga
Bunga
Manga
Reversed Array content:
Manga
Bunga
Dinga
Samba
import java.util.ArrayList;
import java.util.Collections;
Output:
Results before shuffle operation:
Samba
Sambi
Dinga
Dingi
Manga
Mangi
Results after shuffle operation:
Dingi
Manga
Sambi
Dinga
Samba
Mangi
import java.util.ArrayList;
for(String st:s)
{
System.out.println(st);
}
}
}
Output:
Mango
Orange
Apple
Grapes
Guava
import java.util.LinkedList;
for(String st:s)
{
System.out.println(st);
}
}
}
Output:
Mango
Orange
Apple
Grapes
Guava
import java.util.LinkedList;
Output:
First element: Bangalore
Last element: Mysore
import java.util.Iterator;
import java.util.LinkedList;
Iterator it = l.descendingIterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}
Output:
Guava
Grapes
Apple
Orange
Mango
import java.util.HashSet;
import java.util.Iterator;
Iterator it = h2.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}
Output:
Five
One
Four
Two
Three
import java.util.HashSet;
import java.util.Iterator;
h2.retainAll(h1);
Iterator it = h2.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}
Output:
One
Two
Three
import java.util.HashMap;
import java.util.Map;
for(Map.Entry e:m1.entrySet())
{
System.out.println(e.getKey()+" "+e.getValue());
}
}
}
Output:
112 Mango
225 Grapes
185 Orange
441 Pineapple
332 Guava
import java.util.HashMap;
m.put(225, "Grapes");
m.put(332, "Guava");
m.put(441, "Pinapple");
System.out.println(m.containsKey(112));
System.out.println(m.containsKey(445));
}
}
Output:
true
false
import java.util.HashMap;
System.out.println(m.containsValue(“Mango”));
System.out.println(m.containsValue(“Strawberry”));
}
}
Output:
true
false
import java.util.HashMap;
import java.util.Set;
{
HashMap<Integer, String> m = new HashMap<Integer, String>();
m.put(112, "Mango");
m.put(185, "Orange");
m.put(225, "Grapes");
m.put(332, "Guava");
m.put(441, "Pinapple");
Output:
112
225
185
441
332
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
List<String> l = Arrays.asList(s);
Iterator it = l.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}
Output:
Samba
Dinga
Bunga
Ranga
import java.util.List;
import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedHashSet;
List<String> l = Arrays.asList(s);
Output:
One
Two
Three
Four
import java.util.TreeSet;
for(String s:sarr)
{
if(!t.add(s))
{
System.out.println(s);
}
}
}
}
Output:
One
Two
import java.util.ArrayList;
import java.util.Collections;
System.out.println("Largest: "+Collections.max(a));
System.out.println("Smallest: "+Collections.min(a));
}
}
Output:
Largest: 85
Smallest: 15