Top 350+ Solved Data Structures (DS) MCQ Questions Answer
Q. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
a. AB+ CD*E – FG /**
b. AB + CD* E – F **G /
c. AB + CD* E – *F *G /
d. AB + CDE * – * F *G /
Q. The data structure required to check whether an expression contains balanced parenthesis is?
a. Stack
b. Queue
c. Array
d. Tree
Q. What data structure would you mostly likely see in a non recursive implementation of a recursivealgorithm?
a. Linked List
b. Stack
c. Queue
d. Tree
Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a
a. Heap
b. Binary Tree
c. Array
d. Stack
Q. Which data structure is needed to convert infix notation to postfix notation?
a. Branch
b. Tree
c. Queue
d. Stack
Q. The prefix form of an infix expression (p + q) – (r * t) is?
a. + pq – *rt
b. – +pqr * t
c. – +pq * rt
d. – + * pqrt
Q. When an operand is read, which of the following is done?
a. It is placed on to the output
b. It is placed in operator stack
c. It is ignored
d. Operator stack is emptied
Q. What should be done when a left parenthesis ‘(‘ is encountered?
a. It is ignored
b. It is placed in the output
c. It is placed in the operator stack
d. The contents of the operator stack is emptied