SHSubjectHub

Queues: linear, circular and priority

AQA 75174.2 L3A-levelLesson packSubscription
Also online

This worksheet marks itself

Set it as homework or classwork and every answer is marked as pupils go, with feedback on what they got wrong. The scores go straight into your mark book, so you can see who needs help before the next lesson.

  • 11 questions
  • 32 marks
  • about 40 minutes
  • marked instantly

Question types: short answer, matching, true or false, multiple choice.

Try it with a class, freeHow it works

Try one from this worksheet

A circular queue has MaxSize 8, so its cells are numbered 0 to 7. Rear is 7 and the queue is not full. An item is added using Rear ← (Rear + 1) MOD MaxSize. State the new value of Rear.

Pick an answer: it's marked straight away, just as your pupils would see it.

About this resource

AQA A-level Computer Science (7517) 4.2.1.4 Abstract data types: queues · 4.2.2.1 Queues: linear, circular, priority. C# lesson 3 of 8 in 4.2 Fundamentals of data structures: a trace-the-records Do Now, a short key idea, a 10-challenge ladder in three sets with exact test data, two exam questions…

17 slides.

Lesson outline

  1. Do Now: trace the bookings
  2. Do Now: answers
  3. Key idea: A queue: first in, first out
  4. Key idea: A circular queue wraps round
  5. Check: where does the next item go?
  6. Key idea: A priority queue
  7. Set 1: a linear queue, exam style
  8. Set 2: a circular queue
  9. Exam question E1: add to a circular queue
  10. Model answer E1
  11. Exam question E2: priority queue
  12. Model answer E2
Unit bundle4.2 Data structures · full C# lessons
Part of: 4.2 Data structures · full C# lessons: the whole unitEvery resource in the unit in one zip.

More from 4.2 Data structures · full C# lessons