Queues and Stacks (AQA A-Level Computer Science): Flashcards
📚Flashcards
Practise the cards
10 cards from this deck
ShowHide
Practise the cards
10 cards from this deck
Abstract data type
Abstract data type
Theoretical data structure not built into programming languages
Stack structure type
Stack structure type
Last In First Out (LIFO)
Push operation
Push operation
Adding a new item to the top of the stack
Pop operation
Pop operation
Removing an item from the top of the stack
Stack overflow error
Stack overflow error
Trying to push data when the stack is full
Queue structure type
Queue structure type
First In First Out (FIFO)
Linear queue
Linear queue
Queue visualised as data arranged in a line
Circular queue advantage
Circular queue advantage
Wraps pointer around to reuse freed memory spaces
Priority queue
Priority queue
Queue where items processed based on priority ratings
Stack frames
Stack frames
Store info about running programs and function calls