Prefix and Postfix to Infix Conversion Quiz Online Practice Test

1. Find the result of the following prefix expression: `- + 5 / 10 5 5`

2. Determine the result of this prefix expression: `/ / / 16 4 2 1`

3. Find the result for this prefix expression: `+ 9 * 3 / 8 4`

4. Determine the result of the prefix expression `- + 1 2 * 3 / 6 2`.

-6

-3

5. Calculate the result of the prefix expression `- * 1 5 / * / 6 3 6 2`.

-1

-2

6. Find the result for the prefix expression `* / + 1 2 / 4 2 + 3 5`.

7.5

13.5

7. How do prefix and postfix notations differ in their evaluation?

Postfix is solved from the left, prefix from the right

Postfix is solved from the right, prefix from the left

Both are solved from the right

Both are solved from the left

8. What is the initial step when converting prefix notation to infix notation?

Reverse the equation

Push the equation onto the stack

Place the equation in a queue

Use either stack or queue

9. What is the time complexity for converting a prefix notation to infix notation?

O(n) where n is the length of the equation

O(n) where n is the number of operands

O(1)

O(log n) where n is the length of the equation

10. Between converting postfix to infix and prefix to infix, which is easier to implement?

Both are easy to implement

Postfix to infix is harder than prefix to infix

Postfix to infix is easier than prefix to infix

Insufficient data

11. To convert a postfix expression to an infix expression, which data structure is utilized?

Stack

Queue

Linked List

Heap

12. Which infix expression corresponds to the postfix expression `abc+de/*-`?

`a-(b+c)*(d/e)`

`(a+b)-d/e*c`

`abc+-de/*`

`abc+*-(d/e)`

13. Determine the infix expression and its value for the postfix expression `1 2 + 3 * 4 5 * –`.

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

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

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

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

14. Calculate the result of the postfix expression `2 3 + 4 5 6 – – *`.

`19`

`21`

`-4`

`25`

15. Convert the postfix expression `AB+CD-*` into its equivalent prefix form.

`(A+B)*(C-D)`

`+AB*-CD`

`A+*BCD-`

`*+AB-CD`

16. Given the postfix expression `4 5 6 a b 7 8 a c`, where `a`, `b`, and `c` are operators with `a` having the highest precedence and `b` and `c` being right associative, determine the equivalent infix expression.

`4 a 5 6 b 7 8 a c`

`4 a 5 c 6 b 7 a 8`

`4 b 5 a 6 c 7 a 8`

`4 a 5 b 6 c 7 a 8`

17. Which of these represents a valid Reverse Polish Notation (RPN) expression?

`a op b`

`op a b`

`a b op`

Both `op a b` and `a b op`

18. Evaluate the postfix expression `5 3 * 9 + 6 / 8 4 / +` to find the result.

Test Name:	Prefix and Postfix to Infix Conversion Quiz
Subject Category:	Computer Science
Test Type:	Multiple Choice Questions
Total Score / Questions:	18 / 18
Time Allowed:	10 Min
Who Should Practice this Test:	Students, job seekers, or professionals preparing for competitive exams and interviews.

Prefix and Postfix to Infix Conversion MCQ Quiz Online Practice Test