A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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. None of the mentioned
Answer:xyz*+pq*r+s*+
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here