+1 vote
in Data Structures & Algorithms I by (110k points)
Given two processes (conversion of postfix equation to infix notation and conversion of prefix notation to infix notation), which of the following is easier to implement?

(a) Both are easy to implement

(b) Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation

(c) Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation

(d) Insufficient data

The origin of the question is Application of Stacks in portion Application of Stacks of Data Structures & Algorithms I

The question was posed to me in unit test.

1 Answer

+1 vote
by (408k points)
selected by
 
Best answer
The correct choice is (c) Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation

Explanation: As the conversion of prefix notation to infix notation involves reversing the equation, the latter is harder to implement than postfix to infix process.

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

...