Stack and Queue MCQ Questions and Answers for Practice

1. A queue data-structure can be used for

1. expression parsing
2. recursion
3. resource allocation
4. all of the above

2. What data structure is used for breadth first traversal of a graph?

1. queue
2. stack
3. list
4. none of the above

3. What will be the initial value with which top is initialized.

1. -1
2. Garbage
3. 1

4. At the end of last operation, total number of elements present in the stack are

1. 3
2. 2
3. 1

5. Minimum number of queues required for priority queue implementation?

1. 5
2. 4
3. 3
4. 2

6. Popping is an act of

1. Adding values
2. Taking off values from stack
3. Transferring values from stack
4. None of them

7. In linked representation of stack the null pointer of the last node in the list signals ……….

1. Beginning of the stack
2. Bottom of the stack
3. Middle of the stack
4. In between some value

8. Stack is used for

1. CPU Resource Allocation
2. Breadth First Traversal
3. Recursion
4. None of the above

9. In the stack, If user try to remove element from the empty stack then it called as

1. Empty Collection
2. Underflow of Stack
3. Garbage Collection
4. Overflow of Stack

10. Stack in Data Structure is

1. FIFO
2. LIFO
3. LILO
4. None of these

11. A queue is a ?

1. FIFO (First In First Out) list
2. LIFO (Last In First Out) list.
3. Ordered array
4. Linear tree

12. Which of the following is an application of stack?

1. finding factorial
2. tower of Hanoi
3. infix to postfix
4. all of the above

13. Which is the pointer associated with the stack?

1. FIRST
2. FRONT
3. TOP
4. REAR

14. New nodes are added to the ……… of the queue.

1. Front
2. Back
3. Middle
4. Both A and B

15. Deletion operation is done using ……… in a queue.

1. front
2. rear
3. top
4. list