Prefix to Infix Conversion Test

1. What would be the solution to the given prefix notation?

- + 1 2 * 3 / 6 2

-3

-6

2. What would be the solution to the given prefix notation?

- + 5 / 10 5 5

3. What would be the solution to the given prefix notation?

* / + 1 2 / 4 2 + 3 5

7.5

13.5

4. What would be the solution to the given prefix notation?

- * 1 5 / * / 6 3 6 2

-1

-2

5. Given a prefix and a postfix notation what are the difference between them?

The postfix equation is solved starting from the right whereas the prefix notation is solved from the left

Both equations are solved starting from the same side(left)

The postfix equation is solved starting from the left whereas the prefix notation is solved from the right

Both equations are solved starting from the same side(right)

6. The time complexity of converting a prefix notation to infix notation is _________

O(logn) where n is length of the equation

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

O(1)

O(n) where n is number of operands

7. 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?

Both are easy to implement

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

Insufficient data

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

8. What would be the solution to the given prefix notation?

+ 9 * 3 / 8 4

9. When converting the prefix notation into an infix notation, the first step to be followed is ________

Reverse the equation

Push the equation to the stack

Push the equation onto the queue

Push the equation to the stack or queue

10. What would be the solution to the given prefix notation?

/ / / 16 4 2 1