Queues (OCR A-Level Computer Science): Quizzes

📚Quizzes
Queues
Sign up to keep practising.Create a free account to play more quizzes and track your progress.

Practise the questions

12 questions from this quiz

Show

What principle does a queue follow?

First In, First Out (FIFO)

What does the Enqueue operation do?

Adds an item to the rear of the queue

What does the Dequeue operation do?

Removes an item from the front

What is the characteristic of the Peek operation?

Returns front item without removing it

In which algorithm are queues used to explore nodes level by level?

Breadth-First Search (BFS)

How can a queue be dynamically implemented?

Using a linked list

When does queue overflow occur?

Enqueuing into a full queue

When does queue underflow occur?

Dequeuing from an empty queue

How are elements dequeued in a priority queue?

Based on priority

What happens in a circular queue when the rear reaches the end of the array?

It wraps around to the front

Which principle do stacks use, unlike queues?

LIFO (Last In, First Out)

What does the IsFull operation check in a queue?

If queue is at maximum capacity

Explore OCR A-Level Computer Science Revision Notes by Topics

Explore OCR A-Level Computer Science Model Answers by Topics

Explore OCR A-Level Computer Science Flashcards by Topics

Explore OCR A-Level Computer Science Exam Questions by Topics

Join 100,000+ A-Level students studying Quizzes with us.

Select your subjects, and get access to A+ resources today.