1.

How many stacks are required for applying evaluation of infix expression algorithm?(a) one(b) two(c) three(d) fourQuestion is taken from Evaluation of an Infix Expression (Not Parenthesized) in portion Application of Stacks of Data Structures & Algorithms IThe question was asked in homework.

Answer»

Correct answer is (b) TWO

Best explanation: Two STACKS are required for evaluation of infix EXPRESSION – one for OPERANDS and one for OPERATORS.



Discussion

No Comment Found

Related InterviewSolutions