a) true
b) false
Answer: a
Explanation: Stack is used to postfix expression to infix expression. And to convert we follow the following steps: (i) Scan the expression from left to right. (ii) If operand is found, push it on stack.(iii) If operator is found, the two operands are popped and the combined infix expression is formed and pushed onto the stack.
Related Posts
Which one of the following operations returns the first occurrence of bit 1 in bit arrays?
Bit fields and Bit arrays are same.
What does Hamming weight/population count mean in Bit arrays?
Run-Length encoding is used to compress data in bit arrays.
Which of the following bitwise operator will you use to invert all the bits in a bit array?
Which class in Java can be used to represent bit array?
Which of the following is/are not applications of bit arrays?
Join The Discussion