TK Study

Software Engineering › Key terms › Y11 Programming Fundamentals › Stack

Stack

Term Y11 Programming Fundamentals

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 it is used in the test

Syllabus area: Y11 Programming Fundamentals.

Question types it can appear in

No past question in this bank is linked to this term yet. It can still be tested through the question types above.

Study links

How to use it in an answer

A model sentence

General advice, built from the definition and example above

“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.

Technique for the question types

Common mistakes

General advice
  • Use the term exactly as the syllabus words it, then link it to the scenario in the question; the 2025 feedback repeatedly rewards using the stimulus.
  • Answer the command word: outline gives main points only, explain gives a reason or cause, discuss gives both sides.

Same group in the syllabus: Binary (base 2) · Decimal (base 10) · Hexadecimal (base 16) · Two's complement · Character representation (ASCII, Unicode) · Data types · Integer · Real (floating point) · Boolean · Character and string · Date and time · Array · Multi-dimensional array · Record