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:

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

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

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

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 2

Answer:

hdhbr cv fxtcrstgh vhhjddghjj