Question Detail

Which of the following name does not relate to stacks

FIFO lists
LIFO list
Piles
Push-down lists

Answer: Option A

Similar Questions :

1. The complexity of Binary search algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option B

2. The complexity of linear search algorithm is

O(n)
O(log n)
O(n2)
O(n log n)

Answer: Option A

3. O log(n) can be conneted with

Selection sort
Insertion sort
Binary sort
Merge sort

Answer: Option C

4. Which data structure is needed to convert infix notations to postfix notations

linear list
tree
stack
queue

Answer: Option C

5. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1