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
Answer: c
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 Posts
The condition flag Z is set to 1 to indicate _______
When using Branching, the usual sequencing of the PC is altered. A new instruction is loaded which is called as ______
While using the iterative construct (Branching) in execution _____________ instruction is used to check the condition
The Instruction fetch phase ends with _________
The two phases of executing an instruction are __________
In a system, which has 32 registers the register id is __________ long.
The instruction, Add R1,R2,R3 in RTN is _______
Join The Discussion