Algorithms for the Main Data Structures (OCR A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What principle does a stack follow?
What principle does a stack follow?
LIFO (Last In, First Out)
Which operation adds an item to the top of a stack?
Which operation adds an item to the top of a stack?
Push
Which operation removes an item from the top of a stack?
Which operation removes an item from the top of a stack?
Pop
What does the Peek operation do?
What does the Peek operation do?
Returns top item without removing it
What does the IsEmpty operation check?
What does the IsEmpty operation check?
If the stack is empty
What is stack overflow?
What is stack overflow?
Pushing onto a full stack
What is stack underflow?
What is stack underflow?
Popping from an empty stack
Which use case involves stacks storing return addresses?
Which use case involves stacks storing return addresses?
Function call management
How can a stack be implemented dynamically?
How can a stack be implemented dynamically?
Using a linked list
In static stack implementation, what value does top start at?
In static stack implementation, what value does top start at?
-1
What data structure principle is opposite to LIFO?
What data structure principle is opposite to LIFO?
FIFO (First In, First Out)
In browser history, what operation adds a visited webpage to the stack?
In browser history, what operation adds a visited webpage to the stack?
Push