Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q401: What is the action taken when deleting a node from the left subtree of a node with a balance of -1 and the right subtree is balanced?
- A: Perform a single rotation at the parent node
- B: Perform a double rotation at the parent node
- C: Change the balance of the parent node and stop
- D: Continue up the tree without rotation
View Answer
A
Q402: When deleting a node from an AVL tree where the right subtree of the parent node is unbalanced and the parent had a balance of -1, what is the required action?
- A: Perform a double rotation at the parent node
- B: Perform a single rotation at the parent node
- C: Change the balance of the parent node and continue up the tree
- D: Change the balance of the parent node and stop
View Answer
A
Q403: What is the purpose of expression trees in compilers?
- A: To convert source code into machine language
- B: To represent mathematical expressions and parse them
- C: To optimize code execution by removing redundant calculations
- D: To convert code into assembly language
View Answer
B
Q404: In an expression tree, what does the root node typically represent?
- A: The leftmost operand
- B: The rightmost operand
- C: The final result of the expression
- D: The primary operator of the expression
View Answer
D
Q405: What is a parse tree used for in database query processing?
- A: To optimize query execution by removing redundant queries
- B: To convert SQL queries into an optimized machine code
- C: To represent the structure of SQL queries for processing
- D: To translate SQL queries into assembly language
View Answer
C
Q406: What is the role of an optimizer in compilers?
- A: To parse and analyze source code
- B: To convert source code into machine language
- C: To identify and reuse common subexpressions for efficiency
- D: To manage memory allocation during code execution
View Answer
C
Q407: What is the main purpose of an expression tree in compilers?
- A: To parse and analyze source code
- B: To represent mathematical expressions
- C: To manage memory allocation
- D: To optimize code execution
View Answer
B
Q408: In an expression tree, what do the leaf nodes contain?
- A: Operators
- B: Operands
- C: Parent nodes
- D: Subtrees
View Answer
B
Q409: What is the result of an inorder traversal of the expression tree with the expression a + b * c + d * e + f * g?
- A: a + b * c + d * e + f * g
- B: (a + (b * c)) + ((d * e) + (f * g))
- C: a + (b * c) + d * e + f * g
- D: (a + b * c) + (d * e) + (f * g)
View Answer
B
Q410: What does the postorder traversal of the expression tree with the expression a + b * c * d + e * f + g yield?
- A: a b c d * * + e f * + g *
- B: a b c * + d * e f * + g *
- C: a b c * d * + e f * + g *
- D: a b c * d * e f * + g *
View Answer
A