Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q121: Which operation in a linked list-based stack has constant time complexity?
- A: push()
- B: pop()
- C: isEmpty()
- D: All of the above
View Answer
D
Q122: How does the push() method work in a linked list-based stack?
- A: Adds an element at the end
- B: Removes an element at the start
- C: Adds an element at the start
- D: Shifts elements to the right
View Answer
C
Q123: What is the postfix expression of the infix expression A + B * C?
- A: ABC*+
- B: AB+C*
- C: A*BC+
- D: AB*C+
View Answer
A
Q124: In postfix expressions, where are the operators placed?
- A: After operands
- B: Before operands
- C: Between operands
- D: Outside operands
View Answer
A
Q125: In the postfix expression 6 2 3 + -, what is the result after evaluating the first operator?
- A: 5
- B: 4
- C: 1
- D: -1
View Answer
C
Q126: When converting an infix expression to postfix, which operator is handled first in the expression A + B * C?
- A: +
- B: *
- C: -
- D: /
View Answer
B
Q127: Which data structure is commonly used to evaluate postfix expressions?
- A: Queue
- B: Array
- C: Stack
- D: Linked List
View Answer
C
Q128: In evaluating the postfix expression 6 2 3 + -, what will be the value of the stack after applying the first operator +?
- A: [1]
- B: [5, 6]
- C: [1, 5]
- D: [5]
View Answer
D
Q129: How do you handle an operand in the provided postfix evaluation algorithm?
- A: Add to postfix
- B: Push to stack
- C: Pop from stack
- D: Evaluate it
View Answer
B
Q130: What is the main advantage of postfix notation over infix notation?
- A: No parentheses
- B: Easy to understand
- C: Less operators
- D: Faster evaluation
View Answer
A