Arrays
October 16, 2023GATE 2003
October 16, 2023GATE 2002
|
Question 44
|
To evaluate an expression without any embedded function calls
|
One stack is enough
|
|
|
Two stacks are needed
|
|
|
As many stacks as the height of the expression tree are needed
|
|
|
A Turning machine is needed in the general case
|
Question 44 Explanation:
To evaluate an expression or converting prefix to postfix, postfix to prefix only one stack is enough.
Correct Answer: A
Question 44 Explanation:
To evaluate an expression or converting prefix to postfix, postfix to prefix only one stack is enough.