21. Which among the following is not a palindrome?
22. How many passes does the balancing symbols algorithm makes through the input?
23. What would be the solution to the given prefix notation?
* / + 1 2 / 4 2 + 3 5
* / + 1 2 / 4 2 + 3 5
24. While evaluating a prefix expression, the string is read from?
25. Reversing a word using stack can be used to find if the given word is a palindrome or not.
26. hat is the postfix expression for the corresponding infix expression?
a+b*c+(d*e)
a+b*c+(d*e)
27. Which of the following is not an application of stack?
28. How many passes does the evaluation of infix expression algorithm makes through the input?
29. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
30. When converting the prefix notation into an infix notation, the first step to be followed 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.