Stack MCQ : Infix to Postfix Conversion (Multiple Choice Questions)
Question 1 |
Which of the following is an example of Postfix expression
* + A B C | |
A B C ^ / D E * + A C * - | |
(A + B) / C | |
None of these |
Question 2 |
Convert the following infix expression to postfix expression -
A / B ^ C + D * E - A * C
A B C ^ / D E * + A * C - | |
A B C / ^ D E * + A C * - | |
A B C ^ / D E * + A C * - | |
A B C ^ / D * E + A C * - |
Question 3 |
Convert the following infix expression to postfix expression -
B * C - C + D / A / ( E + E )
B C * C - D A / E E + / + | |
B C C * - D A / E E + / + | |
B C C - * D / A E E + / + | |
B C C - * D A / E E + / + |
Question 4 |
In Computer generally _________ expressions are preferred.
Prefix | |
Infix | |
Postfix |
Question 5 |
Data Structure required to evaluate infix to postfix is __________.
Queue | |
Pointer | |
Heap | |
Stack |
There are 5 questions to complete.