Register

GATE CSE 2002 | Question: 2.19

10,022 views
28 votes
28 votes

To evaluate an expression without any embedded function calls

  1. One stack is enough
  2. Two stacks are needed
  3. As many stacks as the height of the expression tree are needed
  4. A Turing machine is needed in the general case
User Avatar

6 Answers

0 votes
0 votes
ans a)
User Avatar
0 votes
0 votes

To evaluate an expression without any embedded function calls, one stack is enough.

Explanation:

  • In an expression evaluation, a single stack is typically used to keep track of operands and operators.
  • The stack helps maintain the correct order of operations and ensures that the expression is evaluated according to the rules of precedence and associativity.
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

29 votes
29 votes
3 answers
1
Kathleen asked Sep 15, 2014
11,487 views
GATE CSE 2002 | Question: 2.6, ISRO2008-19
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
The performance of a pipelined processor suffers if:the pipeline stages have different delaysconsecutive instructions are dependent on each otherthe pipeline stages share...
User Avatar
28 votes
28 votes
4 answers
3
Kathleen asked Sep 15, 2014
6,883 views
GATE CSE 2002 | Question: 2.20
Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure Cryptographic procedures are not available for dynamic linking
Dynamic linking can cause security concerns becauseSecurity is dynamicThe path for searching dynamic libraries is not known till runtimeLinking is insecureCryptographic p...
User Avatar
22 votes
22 votes
5 answers
4
Kathleen asked Sep 15, 2014
10,586 views
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is$\frac{1}{16}$$\frac{1}{8}$$\frac{7}{8}$$\frac{15}{16}$
User Avatar
Link Copied!