Which of these interface is not part of Java’s collection framework?

 What will be the output of the  Java program?

Which of these return type of hasNext() method of an iterator?

Which of these exceptions is thrown by remover() method?

Which of these methods deletes all the elements from invoking collection?

Which of these interface declares core method that all collections will have?

Which of these is an incorrect form of using method max() to obtain maximum element?

Which of these methods can convert an object into a List?

Which of these is true about unmodifiableCollection() method?

Which of these is static variable defined in Collections?

What implementation of Iterator can traverse a collection in both directions?

Which is faster and uses less memory?

What will be output of given code

Which interface does java.util.Hashtable implement?

You need to store elements in a collection that guarantees that no duplicates are stored and all elements can be accessed in natural order.

Which interface provides that capability?

You need to store elements in a collection that guarantees that no duplicates are stored and all elements can be accessed in natural order.

Which interface provides that capability?

Which collection class allows you to grow or shrink its size and provides indexed access to its elements, but whose methods are not synchronized?

The default capacity of a Vector is:

The Comparable interface contains which called?

Find the output

public class TreeMapTest {

public static void main(String args[]) {

Map<Integer, String> m = new TreeMap<Integer, String>();

m.put(11, "audi");

m.put(null, null);

m.put(11, "bmw");

m.put(null, "ferrari");

System.out.println(m.size());

System.out.println(m);

}

public class MyClass {

public static void main(String args[]) {

Map<String, String> hashMap = new HashMap<String, String>();

hashMap.put(new String("a"), "audi");

hashMap.put(new String("a"), "ferrari");

System.out.println(hashMap);

}

}

Deque and Queue are derived from

What will be output of given code

Which is best suited to a multi-threaded environment?

TreeMap implements?

Which of these is synchronized?

TreeMap

How can you sort given HashMap on basis of values

What does Collections.sort internally uses when number of elements are less than 7?

What does Collections.sort internally uses when number of elements are greater than 7?