50+ Prefix to Infix Conversion MCQs with FREE PDF

We have the best collection of the evaluation of a Prefix to Infix Conversion MCQs and answer with FREE PDF. These Prefix to Infix Conversion MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Prefix to Infix Conversion MCQs

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

– + 5 / 10 5 5

a) 2

b) 5

c) 10

d) 7

Answer: 2

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

/ / / / 16 4 2 1

a) 1

b) 4

c) 2

d) 8

Answer: 1

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

+ 9 * 3 / 8 4

a) 14

b) 15

c) 18

d) 12

Answer: 15

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

– + 1 2 * 3 / 6 2

a) 6

b) -6

c) 3

d) -3

Answer: -6

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

– * 1 5 / * / 6 3 6 2

a) 1

b) 0

c) -1

d) -2

Answer: -1

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

* / + 1 2 / 4 2 + 3 5

a) 12

b) 7.5

c) 9

d) 13.5

Answer: 12

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

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

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

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

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

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

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

a) Reverse the equation

b) Push the equation to the stack

c) Push the equation onto the queue

d) Push the equation to the stack or queue

Answer: Reverse the equation

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

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

b) O(n) where n is number of operands

c) O(1)

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

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

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

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

Download PDF (Prefix to Infix Conversion MCQs)

Comments