WorksheetsDSA_VIVA-1
Total questions: 8
Worksheet time: 5mins
_________ is the data structure used for implementing recursion.
Queue
Stack
Array
Linked list
The data structure used in function call management is
Queue
Stack
Tree
Linked list
Which of the following recursion types is most efficient for compiler optimization?
Head recursion
Tail recursion
Tree recursion
Indirect recursion
What is the main drawback of recursion?
Complex logic
Slow execution and high memory usage
Cannot be debugged
Does not work for numeric data
Postfix expression of (A + B) * (C - D) is:
AB+CD-*
ABCD+-*
AB+*CD-
AB+*CD-+
Which of the following postfix expressions corresponds to infix (A + B) * (C + D)?
AB+CD+*
ABCD+*+
A+B*C+D
AB*CD+*
Which of the following traversals gives the postfix expression of an expression tree?
Preorder
Inorder
Postorder
Level order
Given postfix expression 23*54*+9-, the result is:
17
20
25
21
