Data Structure: Stack
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 45% • Most missed: “If the elements .”
Data Structure: Stack
Time left 00:00
25 Questions

1. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))?
2. Which of the following is not an inherent application of stack?
3. Which data structure is used for implementing recursion?
4. What is the value of the postfix expression 6 3 2 4 + .
5. Assume that the operators +,-, X are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c .
6. Process of removing an element from stack is called __________
7. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?
8. What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
9. Which of the following statement(s) about stack data structure is/are NOT correct?
10. What is the result of the following operation? Top (Push (S, X))
11. Convert the following infix expressions into its equivalent postfix expressions: (A + B ⋀D)/(E .
12. Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?
13. Entries in a stack are .
14. The prefix form of an infix expression (p + q) .
15. Process of inserting an element in stack is called ____________
16. In a stack, if a user tries to remove an element from an empty stack it is called _________
17. If the elements .
18. The prefix form of A-B/ (C * D ^ E) is?
19. Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________
20. Which of the following is not the application of stack?
21. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
22. The type of expression in which operator succeeds its operands is?
23. Convert the following Infix expression to Postfix form using a stack: x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
24. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
25. The postfix form of A*B+C/D is?

⚡ Recently practiced quizzes in this topic
Live quiz activity
Objective GS (General Studies) in हिन्दी - Indian States & The Company Rajasthan GK Hindi - Fairs & Festivals Objective GS (General Studies) in हिन्दी - Indian Polity - Historical Background of Constitution Objective GS (General Studies) in हिन्दी - Indian Polity - Judiciary Rajasthan GK Hindi - Culture Objective GS in Hindi - General Geography - Air Pressure, Humidity & Air Movement Rajasthan GK Hindi - Energy Rajasthan GK Hindi - Tourism Rajasthan GK Hindi - Rajasthan Introduction Rajasthan GK Hindi - Rivers & Lakes
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.