+1 vote
in Data Structures & Algorithms I by (110k points)
It is easier for a computer to process a postfix expression than an infix expression.

(a) True

(b) False

Origin of the question is Application of Stacks topic in section Application of Stacks of Data Structures & Algorithms I

The question was asked in quiz.

1 Answer

+1 vote
by (408k points)
selected by
 
Best answer
Right answer is (a) True

For explanation: Computers can easily process a postfix expression because a postfix expression keeps track of precedence of operators.

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.

Categories

...