Stacks In Data Structures - Study Mode

[#146] Evaluation of infix expression is done based on precedence of operators.
Correct Answer

(A) True

[#147] Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?
Correct Answer

(B) If the precedence of operator is higher, pop two operands and evaluate

[#148] Reverse Polish Notation is the reverse of a Polish Notation.
Correct Answer

(B) False

[#149] Using the evaluation of prefix algorithm, evaluate +-9 2 7.
Correct Answer

(D) 14

[#150] Which of the following statement is incorrect with respect to balancing symbols algorithm?
Correct Answer

(B) ([ )]