JAVA interview question set 1

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

1 Mark(s)

max(Collection c)
max(Collection c, Comparator comp)
max(Comparator comp)
max(List c)

Which of these keywords is used to manually throw an exception?

1 Mark(s)

try
finally
throw
catch

Which of these method of Array class is used sort an array or its subset?

1 Mark(s)

binarysort()
bubblesort()
sort()
insert()

What is the correct method used to insert and delete items from the queue?

1 Mark(s)

push and pop
enqueue and dequeue
enqueue and peek
add and remove

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

1 Mark(s)

SetList()
ConvertList()
singletonList()
CopyList()

Which of these methods sets every element of a List to a specified object?

1 Mark(s)

set()
fill()
Complete()
add()

Which of these is static variable defined in Collections?

1 Mark(s)

EMPTY_SET
EMPTY_LIST
EMPTY_MAP
All of the mentioned

Which of the below is not a subinterface of Queue?

1 Mark(s)

BlockingQueue
BlockingEnque
TransferQueue
BlockingQueue

Where does a new element be inserted in linked list implementation of a queue?

1 Mark(s)

Head of list
Tail of list
At the centre of list
All the old entries are pushed and then the new element is inserted

What is difference between dequeue() and peek() function of java?

1 Mark(s)

dequeue() and peek() remove and return the next time in line
dequeue() and peek() return the next item in line
dequeue() removes and returns the next item in line while peek() returns the next item in line
peek() removes and returns the next item in line while dequeue() returns the next item in line

What are the use of front and rear pointers in CircularQueue implementation?

1 Mark(s)

Front pointer points to first element; rear pointer points to the last element
Rear pointer points to first element; front pointer points to the last element
Front and read pointers point to the first element
Front pointer points to the first element; rear pointer points to null object

Which of these keywords is not a part of exception handling?

1 Mark(s)

try
finally
thrown
catch

Which of these is true about unmodifiableCollection() method?

1 Mark(s)

unmodifiableCollection() returns a collection that cannot be modified
unmodifiableCollection() method is available only for List and Set
unmodifiableCollection() is defined in Collection class
none of the mentioned

Which of these keywords must be used to handle the exception thrown by try block in some rational manner?

1 Mark(s)

try
finally
throw
catch

Which of these interface handle sequences?

1 Mark(s)

Set
List
Comparator
Collection

Which of these is a Basic interface that all other interface inherits?

1 Mark(s)

Set
Array
List
Collection

What is the difference between Queue and Stack?

1 Mark(s)

Stack is LIFO; Queue is FIFO
Queue is LIFO; Stack is FIFO
Stack and Queue is FIFO
Stack and Queue is LIFO

Which of the following is a super class of all exception type classes?

1 Mark(s)

Catchable
RuntimeExceptions
String
Throwable

Which of this method is used to make all elements of an equal to specified value?

1 Mark(s)

add()
fill()
all()
set()

Which of the following classes can catch all exceptions which cannot be caught?

1 Mark(s)

RuntimeException
error
Exception
ParentException

Which of this interface must contain a unique element?

1 Mark(s)

Set
List
Array
Collection

Which of the following keywords is used for throwing exception manually?

1 Mark(s)

finally
try
throw
catch

Which of these standard collection classes implements all the standard functions on list data structure?

1 Mark(s)

Array
LinkedList
HashSet
AbstractSet

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

1 Mark(s)

set
EventListner
Comparator
Collection

If the size of the array used to implement a circular queue is MAX_SIZE. How rear moves to traverse inorder to insert an element in the queue?

1 Mark(s)

rear=(rear%1)+MAX_SIZE
rear=(rear+1)%MAX_SIZE
rear=rear+(1%MAX_SIZE)
rear=rear%(MAX_SIZE+1)

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

1 Mark(s)

rand()
randomize()
shuffle()
ambiguous()

Which of these keywords must be used to monitor for exceptions?

1 Mark(s)

try
finally
thrown
catch

PriorityQueue is thread safe.

1 Mark(s)

TRUE
Flash

Which data structure is used in Breadth First Traversal of a graph?

1 Mark(s)

Stack
Queue
Array
Tree

What is the remaining capacity of BlockingQueue whose intrinsic capacity is not defined?

1 Mark(s)

Integer.MAX_VALUE
BigDecimal.MAX_VALUE
99999999
Integer.INFINITY

JAVA interview question set 1 : Question 1 of 30