A Level Computer Science: Queues
This module contains:
Compatible with the following examination boards
Download A Level Module 35: Queues
This download is exclusively for Teach Computer Science subscribers!
To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!
Already a member? Log in to download.
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: