Queues A Level Resources

A Level Computer Science: Queues

This module contains:

  • An editable PowerPoint lesson presentation
  • Editable revision handouts
  • A glossary which covers the key terminologies of the module
  • Topic mindmaps for visualising the key concepts
  • Printable flashcards to help students engage active recall
  • A quiz with answer key to test knowledge and understanding of the module
Compatible with the following examination boards
Queues A Level Resources Image 1
Queues A Level Resources Image 2
Queues A Level Resources Image 3
Queues A Level Resources Image 4
Queues A Level Resources Image 5

Download →

Queues

Queue is a First In, First Out data structure. The elements are inserted to this data structure to the rear end of the queue and the elements are retrieved at the front end of the queue.

This A Level Computer Science module introduces queues to your students, explaining:

  • FIFO data structure
  • Operations in queue
  • Linear queue and circular queue
  • Implementing queues using array and object-oriented programming

More Data types, data structures and algorithms Modules

Queues is one lesson in our Data types, data structures and algorithms module. The other theory lessons can be found below: