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

Here is an infix expression: 4 + 3*(6*3-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

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

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

Four girls P, Q, R and S are studying languages in a University. P is learning French and Dutch. Q is learning Chinese and Japanese. R is learning Spanish and French. S is learning Dutch and Japanese. Given that: French is easier than Dutch; Chinese is harder than Japanese; Dutch is easier than Japanese, and Spanish is easier than French. Based on the above information, which girl is learning the most difficult pair of languages?

A

P

B

Q

C

R

D

S

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

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

A

Stack

B

Queue

C

Linked List

D

Heap

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

A

abc+-de*/

B

(a+[-d/e*c

C

a-(b+[*(d/e)

D

abc+*-(d/e)

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

Which of the following applications may use a stack? (a) Parenthesis balancing program (b) Process scheduling operating system (c) Conversion of infix arithmetic expression to postfix form

A

(a) and (b)

B

(b) and (c)

C

(a) and (c)

D

(a), (b) and (c)

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

Related Questions