Which of the following statement about Set is true?

-Entries are organized as key/value pairs.

-Duplicate entries replace old entries.

-Entries are sorted using a Comparator or the Comparable interface.

Which interface of the java.util package offers the specified behavior?

-Entries are not organized as key/value pairs.

-Duplicate entries are rejected.

Which interface of the java.util package offers the specified behavior?

List listNames = new ArrayList();

listNames.add("Tom");

listNames.add("Mary");

listNames.add("Peter");

String name2 = (String) listNames.get(1);

System.out.println(name2);

What is the output of the above code

What is Collection in Java?

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 methods deletes all the elements from invoking collection?

Which of the following statements are true with respect to sets as objects of Hashset?

Which of the following statements are correct in relation to collections in Java?

Which of the following interfaces declares a core method that all collections will have?

Which of the following statements are correct with respect to a Map in Java?

Which of the following interfaces are not a part of the Java's Collection Framework?

Which of the following statements are correct with respect to a List in Java?

Which of the following interfaces must contain a unique element?

Which of the following method deletes all the elements from invoking (calling) collections?

Which of the following statements are true with respect to a stack?

Which of the following classes implement the Queue interface?

What is Collection in Java?

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?

Which of these packages contain all the collection classes?

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

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

What will be the output of the following Java program?

import java.util.*;

class Array {

public static void main(String args[]) {

int array[] = new int [5];

for (int i = 5; i > 0; i--)

array[5-i] = i;

Arrays.fill(array, 1, 4, 8);

for (int i = 0; i < 5 ; i++) System.out.print(array[i]);

} }

What will be the output of the following Java program?

import java.util.*;

class Bitset {

public static void main(String args[]) {

BitSet obj = new BitSet(5);

for (int i = 0; i < 5; ++i)

obj.set(i);

obj.clear(2);

System.out.print(obj);

} }

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

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?

What will be the output of the program?

TreeSet map = new TreeSet();

map.add("one");

map.add("two");

map.add("three");

map.add("four");

map.add("one");

Iterator it = map.iterator();

while (it.hasNext() )

{

System.out.print( it.next() + " " );

}

What will be the output of the program?package foo;

import java.util.Vector; /* Line 2 */

private class MyVector extends Vector

{

int i = 1; /* Line 5 */

public MyVector()

{

i = 2;

}

}

public class MyNewVector extends MyVector

{

public MyNewVector ()

{

i = 4; /* Line 15 */

}

public static void main (String args [])

{

MyVector v = new MyNewVector(); /* Line 19 */

}

}

What will be the output of the program?

import java.util.*;

class I

{

public static void main (String[] args)

{

Object i = new ArrayList().iterator();

System.out.print((i instanceof List)+",");

System.out.print((i instanceof Iterator)+",");

System.out.print(i instanceof ListIterator);

}

}

-Contains no duplicate elements.

-Can contain at most one Null value.

-Elements are not key-value pairs.

-Accessing an element can be almost as fast as performing a similar operation on an array.

Which of these classes provides the specified features?

Which of the following statements are true with respect to sets as objects of Hashset?

Which of the following interfaces declares a core method that all collections will have?

Which of the following statements are correct with respect to a Map in Java?

Which of the following interfaces must contain a unique element?

Which of the following statements are correct with respect to a List in Java?

We need to access elements frequently by using index...

Which one is better solution?

We want store data in form Key and Value... Whic one is better solution?

We want to create collection of unique elements without duplicates... Which one is better solution?

Contains no duplicate elements

Elements are not key-value pairs

Always unique elements

What does it mean for a list to be "dynamic" in ArrayList?

Collection Framework Comes under which package?

Which option is correct in the following collection interface hierarchy?

Which of the following statement about Set is true?

Collection Framework Comes under which package?

Which option is correct in the following collection interface hierarchy?

When to use Linked List

What is the list nums if it is initially [5, 3, 1] and the following code is executed?

nums.add(6);

nums.add(0, 4);

nums.remove(1);

Which statement below is the correct way to retrieve the first element in the nums ArrayList?

Each time you create a string literal, the JVM checks the ___ first

The ___ in Java is a framework that provides an architecture

to store and manipulate the group of objects

String objects are ____ where as StringBuffer class is ____

The java string charAt() method returns

There are two ways to create String object:

String s = "welcome";

This is an example of creating an object

String s1="Java";

String s2="Java";

• In the above example, how many object will be created.

What will be the output of the program ?

There are three ways to compare string in java. They

" = " operator and "==" operator is different. = operator is used to assign value where as == is used to___

Wrong statement regarding contains() method is

The java string charAt() method returns ___if given index number

is greater than or equal to this string length or a negative number

What will be the output after concatenation performed ?

Which is wrong ?????

1 • Java ArrayList class can't contain duplicate elements.

2 • Java ArrayList class maintains insertion order.

3 • Java ArrayList allows random access because array works at the index basis.

4 • In ArrayList, manipulation is little bit slower than the LinkedList in

Java because a lot of shifting needs to occur if any element is

removed from the array list.

The events can be broadly classified into two categories. They are

The model defines the standard mechanism to generate and

handle the events is called ?

A ____ program contains two or more parts that can run

concurrently and each part can handle a different task at the same

time making optimal use of the available resources specially when

your computer has multiple CPUs

Threads are ___and ___processes within a process.

A thread can be in one of the five states..Which is not a state given below

1. New

2. Runnable

3. Running

4. Suspend

5. Terminated

What is the state of the Thread that waits to acquire the lock

of an object.

The most two important methods in Java Multithreading concept are

The resume() method of thread class is only used with___method

Which method is used here to give new Names to the thread

Which of these packages contain all the collection classes?

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

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

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

What is Collection in Java?

What will be the output of the following Java program?

1. import java.util.*;

2. class Array

3. {

4. public static void main(String args[])

5. {

6. int array[] = new int [5];

7. for (int i = 5; i > 0; i--)

8. array[5-i] = i;

9. Arrays.fill(array, 1, 4, 8);

10. for (int i = 0; i < 5 ; i++)

11. System.out.print(array[i]);

12. }

13. }

What will be the output of the following Java program?

1. import java.util.*;

2. class Bitset

3. {

4. public static void main(String args[])

5. {

6. BitSet obj = new BitSet(5);

7. for (int i = 0; i < 5; ++i)

8. obj.set(i);

9. obj.clear(2);

10. System.out.print(obj);

11. }

12. }

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

Which of these methods is used to obtain an iterator to the start of collection?

Which of these methods can be used to move to next element in a collection?

Which of these iterators can be used only with List?

Which of these is a method of ListIterator used to obtain index of previous element?

What will be the output of the following Java program?

1. import java.util.*;

2. class Collection_iterators

3. {

4. public static void main(String args[])

5. {

6. LinkedList list = new LinkedList();

7. list.add(new Integer(2));

8. list.add(new Integer(8));

9. list.add(new Integer(5));

10. list.add(new Integer(1));

11. Iterator i = list.iterator();

12. Collections.reverse(list);

13. while(i.hasNext())

14. System.out.print(i.next() + " ");

15. }

16. }

What will be the output of the following Java program?

1.   import java.util.*;

2. class Collection_iterators

3. {

4. public static void main(String args[])

5. {

6. LinkedList list = new LinkedList();

7. list.add(new Integer(2));

8. list.add(new Integer(8));

9. list.add(new Integer(5));

10. list.add(new Integer(1));

11. Iterator i = list.iterator();

12. Collections.reverse(list);

13. Collections.sort(list);

14. while(i.hasNext())

15. System.out.print(i.next() + " ");

16. }

17. }

Which of these interfaces is not part of the collection framework in Java?

Which interface does not allow duplicates elements?

Which of these collection classes has the ability to scale dynamically?

HashMap allows _____________

1. The Comparable interface contains which called?

1. Which is faster and uses less memory?

1. Which does NOT implement the Collection interface?

The default capacity of a ArrayList is:

1. Which provides better performance for the insertion and removal from the middle of the list?

1. After resizing, size of ArrayList is increased by :

1. After resizing, size of Vector is increased by:

he default capacity of a ArrayList is:

1. Which is faster and uses less memory?