81. What would be the solution to the given prefix notation?
+ 9 * 3 / 8 4
+ 9 * 3 / 8 4
82. How many stacks are required for applying evaluation of infix expression algorithm?
83. How many stacks are required for evaluation of prefix expression?
84. In Postfix expressions, the operators come after the operands.
85. The system throws an error if parentheses are encountered in an infix expression evaluation algorithm.
86. Out of the following operators (^, *, +, &, $), the one having highest priority is . . . . . . . .
87. Which of the following data structure is used to convert postfix expression to infix expression?
88. 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?
89. Express -15 as a 6-bit signed binary number.
90. The equivalent infix expression and value for the postfix form 1 2 + 3 * 4 5 * - will be . . . . . . . .
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.