91. Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2
92. What is the postfix expression for the infix expression?
a-b-c
a-b-c
93. Which is the predefined method available in Java to convert decimal to binary numbers?
94. What is the corresponding postfix expression for the given infix expression?
a*(b+c)/d
a*(b+c)/d
95. What would be the Prefix notation for the given equation?
(a+(b/c)*(d^e)-f)
(a+(b/c)*(d^e)-f)
96. What determines the order of evaluation of a prefix expression?
97. To convert the postfix expression into the infix expression we use stack and scan the postfix expression from left to right.
98. What is the time complexity of reversing a word using stack algorithm?
99. Which of the following statement is invalid with respect to balancing symbols?
100. When the corresponding end bracket/braces/parentheses is not found, what happens?
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.