The postfix expression abc+de/*- is equivalent to which of the following infix expression?

Here is an infix expression: 4 + 3(63-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

A

1

B

2

C

3

D

4

To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.

A

True

B

False

Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?

A

Both are easy to implement

B

Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation

C

Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation

D

Insufficient data

Consider the postfix expression 4 5 6 a b 7 8 a c, where a, b, c are operators. Operator a has higher precedence over operators b and c. Operators b and c are right associative. Then, equivalent infix expression is

A

4 a 5 6 b 7 8 a c

B

4 a 5 c 6 b 7 a 8

C

4 b 5 a 6 c 7 a 8

D

4 a 5 b 6 c 7 a 8

The equivalent infix expression and value for the postfix form 1 2 + 3 * 4 5 * – will be ___________

A

1 + 2 * 3 – 4 * 5 and -13

B

(2 + 1) * (3 – 4) * 5 and 13

C

1 + 2 * (3 – 4) * 5 and -11

D

(1 + 2) * 3 – (4 * 5) and -11

Which of the following data structure is used to convert postfix expression to infix expression?

A

Stack

B

Queue

C

Linked List

D

Heap

Convert the following Infix expression to Postfix form using a stack. x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

A

xyz*+pq*r+s*+

B

xyz*+pq*r+s+*

C

xyz+*pq*r+s*+

D

xyzp+**qr+s*+

Assume that the operators +,-, X are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c – d ^ e ^ f is?

A

abc X+ def ^^ –

B

abc X+ de^f^ –

C

ab+c Xd – e ^f^

D

-+aXbc^ ^def

It is easier for a computer to process a postfix expression than an infix expression.

A

True

B

False

Convert the following infix expressions into its equivalent postfix expressions. (A + B ⋀D)/(E – F)+G

A

(A B D ⋀ + E F – / G +)

B

(A B D +⋀ E F – / G +)

C

(A B D ⋀ + E F/- G +)

D

(A B D E F + ⋀ / – G +)