61. What should be done when an opening parentheses is read in a balancing symbols algorithm?
62. What is the value of the postfix expression 2 3 + 4 5 6 - - *
63. Evaluation of infix expression is done based on precedence of operators.
64. Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?
65. Reverse Polish Notation is the reverse of a Polish Notation.
66. Using the evaluation of prefix algorithm, evaluate +-9 2 7.
67. Which of the following statement is incorrect with respect to balancing symbols algorithm?
68. An error is reported when the stack is not empty at the end.
69. How many stacks are required for reversing a word algorithm?
70. Evaluate the following infix expression using algorithm and choose the correct answer. a+b*c-d/e^f where a=1, b=2, c=3, d=4, e=2, f=2.
Read More Section(Stacks in Data Structures)
Each Section contains maximum 100 MCQs question on Stacks in Data Structures. To get more questions visit other sections.