Software Engineering › Learn step by step › Y11 Programming Fundamentals
Item 100 of 426 · Year 11: Programming Fundamentals, 54 of 69
Stack
Term
Jump to a topic
- Exam format, question types and command words (46)
- Year 11: Programming Fundamentals (69)
- Year 11: The Object-Oriented Paradigm (33)
- Year 11: Programming Mechatronics (29)
- Year 12: Secure Software Architecture (57)
- Year 12: Programming for the Web (59)
- Year 12: Software Automation (35)
- Year 12: The Software Engineering Project (47)
- Diagrams and modelling tools (18)
- Python, SQL, pseudocode and CSS patterns (33)
Definition
A last-in, first-out (LIFO) structure where items are added (push) and removed (pop) at the top.
Example: Undo uses a stack.
Found in: syllabus.
Where you'll use it in the test
Syllabus area: Y11 Programming Fundamentals.
Question types it can appear in
- Multiple choice: Pick the option that matches the definition or example.
- Fill in the blanks: Choose this term to complete a statement or table.
- Code reading: Code or algorithm reading: interpret a fragment and state its output or purpose.
How to use it
A model sentence
“A last-in, first-out (LIFO) structure where items are added (push) and removed (pop) at the top.” Then apply it: Undo uses a stack.
In a short answer, give the definition in your own words first, then tie it to the situation in the question. Do not copy the example above unless it fits the scenario.
Go deeper
- Flashcard: Stack in Programming Fundamentals (Year 11) · study that set
- Memorise: Data structures
- Full term page: every question, note and marking comment for Stack
Check yourself
Explain “Stack” in one sentence, give an example, and name a question type that could test it.
Reveal the answer
A last-in, first-out (LIFO) structure where items are added (push) and removed (pop) at the top.
Example: Undo uses a stack.
Could be tested as: Multiple choice, Fill in the blanks, Code reading.