Question 1

is the root interface for all the collection classes. The Collection interface 
extends the Iterable interface and therefore all the subclasses of Collection interface also implement 
the

Accepted Answer

iterable interface

Question 2

implemented by all the classes in the collection framework. It declares the methods that every collection will have. In other words, we can say that 
the Collection interface builds the foundation on which the collection framework depends.

Accepted Answer

Collection Interface

Question 3

is the child interface of Collection interface. It inhibits a list type data structure in 
which we can store the ordered collection of objects. It can have duplicate values.

Accepted Answer

List Interface

Question 4

what class implements the List 
interface. It uses a dynamic ____to store 
the duplicate element of different data 
types. The ______ class maintains the 
insertion order and is non-synchronized. 
The elements stored in the _____

Accepted Answer

array list

Question 5

It uses a doubly linked list internally  to store the elements. It can store the duplicate  elements. It maintains the insertion order and is  not synchronized. In __, the  manipulation is fast because no shifting is required.

Accepted Answer

LinkedList

Question 6

uses a dynamic array to store the 
data elements. It is similar to ArrayList. 
However, It is synchronized and contains 
many methods that are not the part of 
Collection framework.

Accepted Answer

Vector

Question 7

. It implements the 
last-in-first-out data structure,

Accepted Answer

Stack

Question 8

maintains the first-in-first-out order. It can be defined as an ordered list that is 
used to hold the elements which are about to be processed

Accepted Answer

Queue Interface

Question 9

The PriorityQueue class implements 
the Queue interface. It holds the 
elements or objects which are to be 
processed by their priorities

Accepted Answer

PriorityQueue

Question 10

, we can remove and add the 
elements from both the side. ____ stands for a double-ended queue which enables us to 
perform the operations at both the ends.

Accepted Answer

Deque Interface

Question 11

____class implements the Deque 
interface. It facilitates us to use the Deque. 
Unlike queue, we can add or delete the 
elements from both the ends.
_____is faster than ArrayList and Stack 
and has no capacity restrictions

Accepted Answer

ArrayDeque

Question 12

represents the unordered set of elements which doesn't allow us to store the duplicate items. We 
can store at most one null value in Set. Set is implemented by HashSet, LinkedHashSet, and 
TreeSet.

Accepted Answer

Set Interface

Question 13

It 
represents the collection that uses a hash 
table for storage. Hashing is used to store the 
elements in the HashSet. It contains unique 
items.

Accepted Answer

Hashset

Question 14

represents the 
LinkedList implementation of Set Interface. It 
extends the HashSet class and implements 
Set interface. Like HashSet, It also contains 
unique elements. It maintains the insertion 
order and permits null elements.

Accepted Answer

Linked Hashset

Question 15

the alternate of Set interface that provides a total ordering on its elements. The  elements of the ____are arranged in the increasing (ascending) order. The _____
provides the additional methods that inhibit the natural ordering of the elements.

Accepted Answer

SortedSet Interface

Question 16

uses a tree for storage. Like 
HashSet, ____also contains unique 
elements. However, the access and retrieval 
time of ____is quite fast. The elements in 
_____stored in ascending order.

Accepted Answer

TreeSe

Question 17

public boolean add(E e)

Accepted Answer

Inserts an element into the collection.

Question 18

public boolean addAll(Collection<? extends E> c)

Accepted Answer

Inserts the specified collection elements into the invoking collection.

Question 19

public boolean remove(Object element)

Accepted Answer

Deletes an element from the collection.

Question 20

public boolean removeAll(Collection<?> c)

Accepted Answer

Deletes all the elements of the specified collection from the invoking collection.

Question 21

default boolean removeIf(Predicate<? super E> filter)

Accepted Answer

Deletes all the elements of the collection that satisfy the specified predicate.

Question 22

public boolean retainAll(Collection<?> c)

Accepted Answer

Deletes all the elements of invoking collection except the specified collection.

Question 23

public int size()

Accepted Answer

Returns the total number of elements in the collection.

Question 24

public void clear()

Accepted Answer

Removes the total number of elements from the collection.

Question 25

public boolean contains(Object element)

Accepted Answer

Searches for an element in the collection.

Question 26

public boolean containsAll(Collection<?> c)

Accepted Answer

Searches the specified collection in the collection.

Question 27

public Iterator iterator()

Accepted Answer

Returns an iterator.

Question 28

public Object[] toArray()

Accepted Answer

Converts collection into array.

Question 29

public <T> T[] toArray(T[] a)

Accepted Answer

Converts collection into array of the specified runtime type.

Question 30

public boolean isEmpty()

Accepted Answer

Checks if collection is empty.

Question 31

default Stream<E> parallelStream()

Accepted Answer

Returns a possibly parallel Stream with the collection as its source.

Question 32

default Stream<E> stream()

Accepted Answer

Returns a sequential Stream with the collection as its source.

Question 33

default Spliterator<E> spliterator()

Accepted Answer

Generates a Spliterator over the elements in the collection.

Question 34

public boolean equals(Object element)

Accepted Answer

Matches two collections.

Question 35

public int hashCode()

Accepted Answer

Returns the hash code number of the collection.

oop module 10

gawa ni jear na baliw

"Know" box contains:
Time elapsed:
Retries: