What is the primary difference between a `Stack` and a `Queue` in the Java Collections Framework?

A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)

A

O(m) and O(n)

B

O(1) and O(n)

C

O(n) and O(1)

D

O(n) and O(m)

A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)

A

1

B

2

C

3

D

4

What is the primary difference between a `Queue` and a `Deque` in the Java Collections Framework?

A

A `Queue` represents a single-ended queue, while a `Deque` represents a double-ended queue

B

A `Queue` allows duplicate elements, while a `Deque` does not

C

A `Deque` is synchronized, while a `Queue` is not

D

A `Queue` is indexed, while a `Deque` is not

You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).

A

O(m)

B

O(n)

Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?

A

q[0]

B

q[1]

C

q[9]

D

q[10]

What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue

A

constructs a cartesian tree

B

sorts the input sequence

C

does nothing

D

produces some random output

The NEP-2020 proposes to prepare which of the curriculum frameworks? (A) National Curriculum Framework for School Education (B) National Curriculum Framework for Adult Education (C) National Curriculum Framework for Teacher Education (D) National Curriculum Framework for Technical Education (E) National Curriculum Framework for Vocational Education Choose the correct answer from the options given below :

A

(A), (C), (E) only

B

(B), (C), (D) only

C

(A), (B), (C) only

D

(C), (D), (E) only

What is the purpose of the `Collections.reverse()` method in the Java Collections Framework?

A

It removes all elements from a list

B

It sorts a list in ascending order

C

It adds elements to a list

D

It reverses the order of elements in a list

What is the primary difference between a `List` and a `Set` in the Java Collections Framework?

A

A `Set` allows duplicate elements, while a `List` does not

B

A `List` is unmodifiable, while a `Set` is modifiable

C

A `List` allows duplicate elements, while a `Set` does not

D

A `Set` is indexed, while a `List` is not

What is the primary difference between a `HashMap` and a `TreeMap` in the Java Collections Framework?

A

A `TreeMap` uses a linked list to store elements

B

A `HashMap` is synchronized, while a `TreeMap` is not

C

A `TreeMap` allows duplicate keys, while a `HashMap` does not

D

A `HashMap` does not maintain order, while a `TreeMap` does

What is the primary difference between a `Stack` and a `Queue` in the Java Collections Framework?

Related Questions