Data Structures MCQs – Stack
1. Process of inserting an element in stack is called ____________
a) Create
b) Push
c) Evaluation
d) Pop
Answer: b
Explanation: Push inserts elements into the stack.
2. Process of removing an element from stack is called __________
a) Create
b) Push
c) Evaluation
d) Pop
Answer: d
Explanation: Pop removes the top element.
3. Removing from empty stack is called _________
a) Underflow
b) Empty collection
c) Overflow
d) Garbage Collection
Answer: a
4. Pushing into full stack results in ___________
a) Overflow
b) Crash
c) Underflow
d) User flow
Answer: a
5. Stack entries are ordered means ___________
a) Sortable
b) Comparable
c) Linked list
d) Sequential entry
Answer: d
Explanation: Stack follows LIFO order.
6. Which is not an application of stack?
a) Parentheses balancing
b) Local variables tracking
c) Compiler syntax analyzer
d) Data transfer between processes
Answer: d
7. Max stack size for (()(())(()))?
a) 1
b) 2
c) 3
d) 4 or more
Answer: c
