0% found this document useful (0 votes)
275 views

26 Collection Framework Practising Programs PDF

This document contains practice questions and examples related to Java's Collection Framework. It begins with 13 multiple choice questions about core concepts like Collection, List, Set, and Map interfaces. It then provides code examples demonstrating how to work with ArrayLists and LinkedLists, such as copying and reversing elements, and converting between list and array formats. The examples cover common list operations like cloning, checking for contained elements, and shuffling order.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
275 views

26 Collection Framework Practising Programs PDF

This document contains practice questions and examples related to Java's Collection Framework. It begins with 13 multiple choice questions about core concepts like Collection, List, Set, and Map interfaces. It then provides code examples demonstrating how to work with ArrayLists and LinkedLists, such as copying and reversing elements, and converting between list and array formats. The examples cover common list operations like cloning, checking for contained elements, and shuffling order.
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Java Collection Framework Practising Programs

Core Java Collection Framework Practice Questions

1. Object which can store group of other objects is known as___________


/*
Options
A) Collection object
B) Java object
C) Package
D) none of these
*/

2. All collection classes are available in ___________ package.


/*
Options
A) java.io
B) java.lang
C) java.awt
D) java.util
*/

3. Vector class available in ____________


/*
Options
A) java.io package
B) java.util package
C) java.lang package
D) java.SQL package
*/

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
*/

5. Which specifies the following two methods ?


//boolean hasMoreElements()
//Object nextElement()
/*
Options
A) Enumeration
B) Bitset
C) Vector
D) Stack
*/

6. Which of these classes is not part of Java’s collection framework?

pg. 1 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

/*
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()
*/

8. Which of these interface handle sequences?


/*
Options
A) Set
B) List
C) Comparator
D) Collection
*/

9. Which of these interface must contain a unique element?


/*
Options
A) Set
B) List
C) Array
D) Collection
*/

10. Which of these methods sets every element of a List to a specified object?
/*
Options
A) set()
B) fill()
C) Complete()
D) add()
*/

11. Which of these methods can randomize all elements in a list?


/*
Options
A) rand()
B) randomize()
C) shuffle()
D) ambigous()

pg. 2 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

*/

12. Which interface does java.util.Hashtable implement?


/*
Options
A) Java.util.Map
B) Java.util.List
C) Java.util.HashTable
D) Java.util.Collection
*/

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.

1. How to copy or clone an ArrayList?

pg. 3 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

import java.util.ArrayList;

public class ArrayListClone


{
public static void main(String [] args)
{
ArrayList<String>arr = new ArrayList<String>(); //adding elements to the end
arr.add("Samba");
arr.add("Dinga");
arr.add("Bunga");
arr.add("Manga");

System.out.println("Actual ArrayList: "+arr);

ArrayList<String> copy = (ArrayList<String>) arr.clone();


System.out.println("Cloned ArrayList: "+copy);
}
}

Output:
Actual ArrayList: [Samba, Dinga, Bunga, Manga]
Cloned ArrayList: [Samba, Dinga, Bunga, Manga]

2. How to find does ArrayList contains all list elements or not?

import java.util.ArrayList;
import java.util.List;

public class ElementCheck


{
public static void main(String [] args)
{
ArrayList<String>arr1 = new ArrayList<String>();
arr1.add("Samba");
arr1.add("Dinga");
arr1.add("Bunga");
arr1.add("Ranga");

List<String> arr2 = new ArrayList<String>();


arr2.add("Samba");
arr2.add("Dinga");
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));

System.out.println("-------------------------------------------------");
arr2.add("Manga");
System.out.println("Does arr1 contains all arr2 elements?");
System.out.println("arr1: "+arr1);

pg. 4 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

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

3. How to reverse ArrayList elements.

import java.util.ArrayList;

public class ArrayListToArray


{
public static void main(String [] args)
{
ArrayList<String>arr = new ArrayList<String>();
arr.add("Samba");
arr.add("Dinga");
arr.add("Bunga");
arr.add("Manga");
System.out.println("Actual ArrayList:"+arr);

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

pg. 5 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

Dinga
Bunga
Manga
Reversed Array content:
Manga
Bunga
Dinga
Samba

4. How to shuffle elements in ArrayList?

import java.util.ArrayList;
import java.util.Collections;

public class ArrayListShuffle


{
public static void main(String a[])
{
ArrayList<String> arr = new ArrayList<String>();
arr.add("Samba");
arr.add("Sambi");
arr.add("Dinga");
arr.add("Dingi");
arr.add("Manga");
arr.add("Mangi");
System.out.println("Results before shuffle operation:");
for(String str: arr)
{
System.out.println(str);
}
}
}

Output:
Results before shuffle operation:
Samba
Sambi
Dinga
Dingi
Manga
Mangi
Results after shuffle operation:
Dingi
Manga
Sambi
Dinga
Samba
Mangi

pg. 6 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

5. Program to copy ArrayList elements into Array object.

import java.util.ArrayList;

public class ArrayListToArray


{
public static void main(String[] args)
{
ArrayList<String> a = new ArrayList<String>();
a.add("Mango");
a.add("Orange");
a.add("Apple");
a.add("Grapes");
a.add("Guava");

int size = a.size();


String s[ ] = new String[size];
a.toArray(s);

for(String st:s)
{
System.out.println(st);
}
}
}
Output:
Mango
Orange
Apple
Grapes
Guava

6. Program to copy LinkedList elements into Array object

import java.util.LinkedList;

public class LinkedListToArray


{
public static void main(String[] args)
{
LinkedList<String> l = new LinkedList<String>();
l.add("Mango");
l.add("Orange");
l.add("Apple");
l.add("Grapes");
l.add("Guava");

pg. 7 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

int size = l.size();


String s[] = new String[size];
l.toArray(s);

for(String st:s)
{
System.out.println(st);
}
}
}

Output:
Mango
Orange
Apple
Grapes
Guava

7. Program to get First and Last elements from LinkedList.

import java.util.LinkedList;

public class FirstAndLastElement


{
public static void main(String[] args)
{
LinkedList l = new LinkedList();
l.add("Bangalore");
l.add("Pune");
l.add("Mumbai");
l.add("Chennai");
l.add("Mysore");

System.out.println("First element: "+l.getFirst());


System.out.println("Last element: "+l.getLast());
}
}

Output:
First element: Bangalore
Last element: Mysore

8. Program to iterate LinkedList elements in reverse order.

import java.util.Iterator;

pg. 8 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

import java.util.LinkedList;

public class ReverseIterate


{
public static void main(String[] args)
{
LinkedList<String> l = new LinkedList<String>();
l.add("Mango");
l.add("Orange");
l.add("Apple");
l.add("Grapes");
l.add("Guava");

Iterator it = l.descendingIterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}

Output:
Guava
Grapes
Apple
Orange
Mango

9. Program to copy one Set elements to another Set.

import java.util.HashSet;
import java.util.Iterator;

public class CopyHashSet


{
public static void main(String[] args)
{
HashSet h1 = new HashSet();
h1.add("One");
h1.add("Two");
h1.add("Three");
h1.add("Four");
h1.add("Five");

HashSet h2 = new HashSet();


h2.addAll(h1);

Iterator it = h2.iterator();
while(it.hasNext())

pg. 9 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

{
System.out.println(it.next());
}
}
}

Output:
Five
One
Four
Two
Three

10. Program to compare and retain elements of two Set Objects.

import java.util.HashSet;
import java.util.Iterator;

public class RetainSetElements


{
public static void main(String[] args)
{
HashSet h1 = new HashSet();
h1.add("One");
h1.add("Two");
h1.add("Three");

HashSet h2 = new HashSet();


h2.add("One");
h2.add("Two");
h2.add("Three");
h2.add("Four");
h2.add("Five");

h2.retainAll(h1);

Iterator it = h2.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}

}
}

Output:
One
Two

pg. 10 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

Three

11. Program to copy Map elements to another Map.

import java.util.HashMap;
import java.util.Map;

public class CopyMapElements


{
public static void main(String[] args)
{
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, "Pineapple");

HashMap<Integer, String> m1 = new HashMap<Integer, String>();


m1.putAll(m);

for(Map.Entry e:m1.entrySet())
{
System.out.println(e.getKey()+" "+e.getValue());
}
}
}

Output:
112 Mango
225 Grapes
185 Orange
441 Pineapple
332 Guava

12. Program to find key in HashMap.

import java.util.HashMap;

public class MapFindKey


{
public static void main(String[] args)
{
HashMap<Integer, String> m = new HashMap<Integer, String>();
m.put(112, "Mango");
m.put(185, "Orange");

pg. 11 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

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

13. Program to find value in HashMap.

import java.util.HashMap;

public class MapFindKey


{
public static void main(String[] args)
{
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");

System.out.println(m.containsValue(“Mango”));
System.out.println(m.containsValue(“Strawberry”));
}
}

Output:
true
false

14. Program to get all the key from HashMap.

import java.util.HashMap;
import java.util.Set;

public class MapGetAllKey


{
public static void main(String[] args)

pg. 12 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

{
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");

Set<Integer> key = m.keySet();


for(int i:key)
{
System.out.println(i);
}
}
}

Output:
112
225
185
441
332

15. Program to convert Array into List.

import java.util.Arrays;
import java.util.Iterator;
import java.util.List;

public class ArrayToList


{
public static void main(String[] args)
{
String s[] = {"Samba", "Dinga", "Bunga", "Ranga"};

List<String> l = Arrays.asList(s);

Iterator it = l.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}

Output:
Samba

pg. 13 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

Dinga
Bunga
Ranga

16. Program to remove duplicates from an Array.

import java.util.List;
import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedHashSet;

public class ArrayRemoveDuplicates


{
public static void main(String[] args)
{
String s[] = {"One", "Two", "One", "Three", "Four"};

List<String> l = Arrays.asList(s);

LinkedHashSet t = new LinkedHashSet(l);


Iterator it = t.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
}
}

Output:
One
Two
Three
Four

17. Program to find duplicate from an Array.


package Set;

import java.util.TreeSet;

public class ArrayFindDuplicates


{
public static void main(String[] args)
{
String sarr[] = {"One", "Two", "One", "Three", "Four","Two"};

pg. 14 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

TreeSet t = new TreeSet();

for(String s:sarr)
{
if(!t.add(s))
{
System.out.println(s);
}
}
}
}

Output:
One
Two

18. Program to find largest and smallest element from ArrayList.

import java.util.ArrayList;
import java.util.Collections;

public class FindLargestAndSmallestElement


{
public static void main(String[] args)
{
ArrayList a = new ArrayList();
a.add(25);
a.add(15);
a.add(35);
a.add(85);
a.add(65);
a.add(55);

System.out.println("Largest: "+Collections.max(a));
System.out.println("Smallest: "+Collections.min(a));
}
}

Output:
Largest: 85
Smallest: 15

pg. 15 Gagan Dev


Gagandev9@gmail.com
Java Collection Framework Practising Programs

pg. 16 Gagan Dev


Gagandev9@gmail.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy