+1 vote
in Data Structures & Algorithms I by (110k points)
How many passes does the evaluation of infix expression algorithm makes through the input?

(a) One

(b) Two

(c) Three

(d) Four

This interesting question is from Evaluation of an Infix Expression (Not Parenthesized) topic in chapter Application of Stacks of Data Structures & Algorithms I

I got this question by my school principal while I was bunking the class.

1 Answer

+1 vote
by (444k points)
selected by
Best answer
Right option is (a) One

The best I can explain: Evaluation of infix expression algorithm is linear and makes only one pass through the input.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.