Advance Stack

Convert to postfix form of A * B + C / D is

• AB*CD/+

• *AB/CD+

• A*BC+/D

• ABCD+/*

Convert the following Infix to Postfix form

v * w + (x * y) + z

• vw*xy*+z+

• vw*xy+*z*

• vw+xy*z+

• none

What is the value of the postfix expression 6 3 2 4 + – *

• -18

• 1

• 40

• 74

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

• AB + CDE * - * F *G /

• AB+ CD*E - FG /**

• AB + CD* E - F **G /

• AB + CD* E - *F *G /

The prefix form of A-B/ (C * D ⋀ E) is?

• -/*⋀ACBDE

• -ABCD*⋀DE

• -A/B*C⋀DE

• -A/BC*⋀DE

Convert the following Infix expression to Postfix form using a stack

x + y * z + (p * q + r) * s

• xyz*+pq*r+s*+

• xyz*+pq*r+s+*

• xyz+*pq*r+s*+

• none

The following postfix expression with single digit operands is evaluated using a stack:

8 2 3 ^ / 2 3 *

• 6,1

• 5,7

• 3,2

• 1,6

Convert the infix exression

(A + B) * (C + D)

to Postfix.

• A B C * + D +

• A B + C D + *

• A B * C D * +

• A B + C + D +

 

Convert a given infix

expression (x + y)/(z*8) into equivalent postfix expression

• xyz/8*+

• xyz8*/+

• xy+z8*/

• xy+z/8*

What is the value of the postfix expression 5 1 2 + 4 * + 3 -

• 14

• 10

• 12

• 8