Class 12 Computer Science — Chapter 3: Stack

What you'll learn

• ▸The Stack Data Structure (LIFO)
• ▸Core Stack Operations (PUSH and POP)
• ▸Python Implementation of a Stack using Lists
• ▸Applications of Stacks
• ▸Notations for Arithmetic Expressions
• ▸Conversion from Infix to Postfix Notation
• ▸Evaluation of Postfix Expressions

Chapter Summary

--- PAGE 1 --- Chapter 3 Stack "We're going to be able to ask our computers to monitor things for us, and when certain conditions happen, are triggered, the computers will take certain actions and inform us after the fact." — Steve Jobs In this Chapter » Introduction » Stack » Operations on Stack » Implementation of Stack in Python » Notations for Arithmetic Expressions » Conversion From Infix To Postfix Notation » Evaluation of Postfix Expression 3.1 INTRODUCTION We have learnt about different data types in Python for handling values in Class XI. Recall that String, List, Set, Tuple, etc. are the sequence data types that can be used to represent collection of elements either of the same type or different types. Multiple data elements are grouped in a particular way for faster accessibility and efficient storage of data. That is why we have used different data types in python for storing data values. Such grouping is referred as a data st…

Practice Questions from this Chapter

Tap "Get Solution" on any question to ask our AI tutor.

1. Explain how undo/redo works. Get Solution →
2. Show real-world stack examples. Get Solution →
3. Compare stack with queue. Get Solution →
4. According to the text, what principle does a stack data structure follow? Get Solution →
5. What is the name of the operation used to add a new element to the top of a stack? Get Solution →
6. What is the name of the operation used to remove the topmost element from a stack? Get Solution →
7. The text describes an 'underflow' condition. When does this occur? Get Solution →
8. In the Python implementation of a stack using a list, which built-in list method is used for the PUSH operation? Get Solution →

Did you know?

• 💡 A PEZ dispenser works exactly like a stack, with the last candy in being the first out.
• 💡 Mathematical operations follow a stack-like priority, evaluating some parts first.
• 💡 The idea of a 'stack' for computers was formalized in the 1940s by Alan Turing's group.
• 💡 The game Jenga involves removing blocks in a stack-like way from the top.
• 💡 Unlike a stack, a grocery store checkout line uses a First-In-First-Out (FIFO) rule.

Frequently Asked Questions

Related Chapters