To evaluate an expression without any embedded function calls, assume it has…
GATE · 2002 · CS · Question 2 subpartsModified — slightly modified from the official paper; see the solution
To evaluate an expression without any embedded function calls, assume it has already been converted to postfix form:
- A.
One stack is enough
- B.
Two stacks are needed
- C.
As many stacks as the height of the expression tree are needed
- D.
A Turing machine is needed in the general case
Attempted by 1400 students.
Show answer
Correct answer: A
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…