11. Of the following choices, which operator has the lowest precedence?
12. What would be the solution to the given prefix notation?
- + 5 / 10 5 5
- + 5 / 10 5 5
13. It is easier for a computer to process a postfix expression than an infix expression.
14. If -*+abcd = 11, find a, b, c, d using evaluation of prefix algorithm.
15. The associativity of an exponentiation operator ^ is right side.
16. While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed?
17. What would be the Prefix notation for the given equation?
(A*B)+(C*D)
(A*B)+(C*D)
18. What is the corresponding postfix expression for the given infix expression?
a+(b*c(d/e^f)*g)*h)
a+(b*c(d/e^f)*g)*h)
19. Identify the infix expression from the list of options given below.
20. The optimal data structure used to solve Tower of Hanoi is . . . . . . . .
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.