Question

Evaluate the following postfix expression using a stack: 93-52+* Process each token in the expression one at a time. Record the values in the stack from top to bottom after each individual token is completely processed. Thus, the number of steps you record must be equal to the number of individual tokens in the expression. The top of the stack is the LEFTMOST value. Each provided option can be used once, more than once, or not at all. Step 1 ? [Choose] 5, 6 -42 42 Step 2 9, 3 -6, 7 -6, 5 6, 7 Step 3 6, 5 7, 6 9 Step 4 2, 5, 6 2, 5, -6 6 -6, 5, 2 Step 5 5, -6 7, -6 6, 5, 2 -6 Step 6 Step 7 3, 9 [Choose]

          Evaluate the following postfix expression using a stack:
93-52+*
Process each token in the expression one at a time. Record the values in the
stack from top to bottom after each individual token is completely
processed. Thus, the number of steps you record must be equal to the
number of individual tokens in the expression. The top of the stack is the
LEFTMOST value. Each provided option can be used once, more than once,
or not at all.
Step 1
? [Choose]
5, 6
-42
42
Step 2
9, 3
-6, 7
-6, 5
6, 7
Step 3
6, 5
7, 6
9
Step 4
2, 5, 6
2, 5, -6
6
-6, 5, 2
Step 5
5, -6
7, -6
6, 5, 2
-6
Step 6
Step 7
3, 9
[Choose]

Evaluate the following postfix expression using a stack:
93-52+*
Process each token in the expression one at a time. Record the values in the
stack from top to bottom after each individual token is completely
processed. Thus, the number of steps you record must be equal to the
number of individual tokens in the expression. The top of the stack is the
LEFTMOST value. Each provided option can be used once, more than once,
or not at all.
Step 1
? [Choose]
5, 6
-42
42
Step 2
9, 3
-6, 7
-6, 5
6, 7
Step 3
6, 5
7, 6
9
Step 4
2, 5, 6
2, 5, -6
6
-6, 5, 2
Step 5
5, -6
7, -6
6, 5, 2
-6
Step 6
Step 7
3, 9
[Choose]

Added by Maurice P.

Question

Please give Ace some feedback