Stack and Queue MCQs (60 Questions
with Answers)
1. What is the principle of Stack?
A. FIFO
B. LIFO
C. Random access
D. Priority-based
Answer: B
2. Which operation inserts an element into a stack?
A. Pop
B. Push
C. Peek
D. Display
Answer: B
3. Which operation removes an element from a stack?
A. Push
B. Pop
C. Peek
D. Insert
Answer: B
4. What does Peek operation do?
A. Deletes top element
B. Adds element
C. Returns top element without removing
D. Sorts stack
Answer: C
5. Stack overflow occurs when:
A. Stack is empty
B. Stack is full
C. Stack has one element
D. Stack is reversed
Answer: B
6. Stack underflow occurs when:
A. Stack is full
B. Stack is empty
C. Stack has elements
D. Stack is sorted
Answer: B
7. In array implementation, stack size is:
A. Dynamic
B. Fixed
C. Infinite
D. Random
Answer: B
8. Time complexity of push operation:
A. O(n)
B. O(log n)
C. O(1)
D. O(n²)
Answer: C
9. Top variable in stack represents:
A. Bottom element
B. Index of last inserted element
C. Size of array
D. Memory address
Answer: B
10. Initial value of top in empty stack:
A. 0
B. 1
C. -1
D. NULL
Answer: C
11. In linked list stack, insertion happens at:
A. End
B. Middle
C. Beginning
D. Random
Answer: C
12. Advantage of linked list stack:
A. Fixed size
B. Memory wastage
C. Dynamic size
D. Slow operations
Answer: C
13. Which memory is used in linked list stack?
A. Stack memory
B. Heap memory
C. Cache
D. ROM
Answer: B
14. Which application uses stack?
A. CPU scheduling
B. Recursion
C. Printing
D. Buffering
Answer: B
15. String reversal uses:
A. Queue
B. Stack
C. Tree
D. Graph
Answer: B
16. Balanced parentheses use:
A. Queue
B. Stack
C. Heap
D. Array
Answer: B
17. Which expression type is easiest for evaluation using stack?
A. Infix
B. Prefix
C. Postfix
D. Binary
Answer: C
18. In postfix, operator comes:
A. Before operands
B. Between operands
C. After operands
D. Random
Answer: C
19. Infix example:
A. AB+
B. +AB
C. A+B
D. AB
Answer: C
20. Prefix example:
A. AB+
B. +AB
C. A+B
D. A*B
Answer: B
21. Postfix evaluation uses:
A. Queue
B. Stack
C. Tree
D. Graph
Answer: B
22. What is pushed first in postfix evaluation?
A. Operators
B. Operands
C. Both
D. None
Answer: B
23. Operator precedence is handled in:
A. Stack
B. Queue
C. Array
D. Linked list
Answer: A
24. Which symbol is used to check precedence?
A. +
B. *
C. Stack top
D. Queue front
Answer: C
25. Conversion from infix to postfix uses:
A. Queue
B. Stack
C. Tree
D. Graph
Answer: B
26. Queue follows:
A. LIFO
B. FIFO
C. Random
D. Priority
Answer: B
27. Insertion in queue is called:
A. Push
B. Pop
C. Enqueue
D. Insert
Answer: C
28. Deletion in queue is called:
A. Pop
B. Dequeue
C. Remove
D. Delete
Answer: B
29. Queue insertion happens at:
A. Front
B. Rear
C. Middle
D. Top
Answer: B
30. Queue deletion happens at:
A. Front
B. Rear
C. Middle
D. Top
Answer: A
31. Initial front and rear values:
A. 0
B. 1
C. -1
D. NULL
Answer: C
32. Queue overflow condition:
A. front == rear
B. rear == size-1
C. front == -1
D. rear == -1
Answer: B
33. Queue underflow condition:
A. rear == size-1
B. front == -1 or front > rear
C. front == rear
D. rear == -1
Answer: B
34. Limitation of linear queue:
A. Slow
B. Memory wastage
C. Infinite size
D. Dynamic
Answer: B
35. Circular queue solves:
A. Overflow
B. Underflow
C. Memory wastage
D. Sorting
Answer: C
36. Circular queue condition:
A. rear == size
B. (rear + 1) % size == front
C. front == rear
D. rear == front+1
Answer: B
37. Circular queue uses:
A. Linear array
B. Modulo operator
C. Recursion
D. Tree
Answer: B
38. Linked list queue insertion:
A. Front
B. Rear
C. Middle
D. Random
Answer: B
39. Linked list queue deletion:
A. Rear
B. Front
C. Middle
D. Random
Answer: B
40. Advantage of linked list queue:
A. Fixed size
B. Dynamic size
C. Slow
D. Complex
Answer: B
41. Queue is used in:
A. Recursion
B. CPU scheduling
C. Expression evaluation
D. Sorting
Answer: B
42. Printer queue is example of:
A. Stack
B. Queue
C. Tree
D. Graph
Answer: B
43. BFS traversal uses:
A. Stack
B. Queue
C. Tree
D. Heap
Answer: B
44. Which structure is used in buffering?
A. Stack
B. Queue
C. Graph
D. Heap
Answer: B
45. Simulation systems use:
A. Stack
B. Queue
C. Array
D. Tree
Answer: B
46. Stack vs Queue difference:
A. Both FIFO
B. Both LIFO
C. Stack LIFO, Queue FIFO
D. No difference
Answer: C
47. Stack is used in:
A. Scheduling
B. Undo operations
C. Printing
D. Buffering
Answer: B
48. Queue is used in:
A. Undo
B. Backtracking
C. Scheduling
D. Expression evaluation
Answer: C
49. Which allows insertion and deletion at one end?
A. Queue
B. Stack
C. Array
D. Linked list
Answer: B
50. Which allows insertion and deletion at different ends?
A. Stack
B. Queue
C. Tree
D. Graph
Answer: B
51. Postfix of A + B?
A. AB+
B. +AB
C. A+B
D. BA+
Answer: A
52. Prefix of A + B?
A. AB+
B. +AB
C. A+B
D. BA+
Answer: B
53. Postfix of A + B * C?
A. AB+C*
B. ABC*+
C. AB*C+
D. *+ABC
Answer: B
54. Prefix of A + B * C?
A. +A*BC
B. *+ABC
C. AB*C+
D. +*ABC
Answer: A
55. Postfix of (A + B) * C?
A. AB+C*
B. ABC+*
C. AB*C+
D. *+ABC
Answer: A
56. Prefix of (A + B) * C?
A. *+ABC
B. +*ABC
C. AB+C*
D. *AB+C
Answer: A
57. Which DS is used in infix to postfix?
A. Queue
B. Stack
C. Array
D. Tree
Answer: B
58. Operators are pushed based on:
A. Operand value
B. Precedence
C. Alphabet
D. Random
Answer: B
59. When do we pop in conversion?
A. On operand
B. Higher/equal precedence
C. Empty stack
D. Never
Answer: B
60. Postfix of A * (B + C) / D?
A. ABC+*D/
B. AB+C*D/
C. ABC+*/D
D. AB*C+D/
Answer: A