Question

2. Which is the correct algorithmic sequence for the conversion of an expression from Infix to prefix? A.
Change of every "(" (opening bracket) by ")" (closing bracket) and vice-versa. B. Reversal of an infix
expression. C. Conversion of the modified express
(A) A, B, C, D
(B) C, A, D, B
(C) B,A,C,D
(D) D, B, A, C​​

Answer 1

Explanation:

C}. B, A, C, D

I HOPE IT MAY HELP TO YOU

Answer 2

Answer:

Option c) B, A, C is the correct answer.

Explanation:

For converting an expression from infix to prefix, the correct algorithmic sequence is:

B. First reverse the infix operation.

A. Then change every opening bracket with closing bracket and vice-versa.

C. Finally perform the conversion of the modified expression.

Hence, we get option c) B, A, C as the final correct answer.