24. AQA A Level Stacks & Queues Part 2 📚

AQA Specification Reference
A Level 4.2.2.1 & 4.2.3.1

This is the second of two videos looking Stacks and Queues. In this video we present pseudocode for adding, removing and testing for full and empty Stacks and Queues.

Key questions:

- How do stacks and queues work?
- How do you create stacks and queues?
- How do you add a data item to stacks and queues?
- How do you remove a data item from stacks and queues?
- How do you traverse stacks and queues?

00:00 Stacks and queues - Part 2
00:05 Intro
00:10 A note about this video
00:25 Traversing, adding to and removing from stacks and queues
00:59 Adding items to stacks and queues
01:06 Adding an item to a stack (push)
02:58 Adding an item to a queue (enqueue)
04:22 Removing items from stacks and queues
04:28 Removing an item from a stack (pop)
05:48 Removing an item from a queue (dequeue)
06:59 Traversing stacks and queues
07:40 Key questions
07:59 Going beyond the specification
08:07 Separating implementation from abstraction
08:48 Essential algorithms and data structures text book
09:36 Outro

Why do we disable comments? We want to ensure these videos are always appropriate to use in the classroom. However, we value your feedback, and are happy to consider amendments due to inaccuracies. Please get in touch with us directly at: admin@craigndave.co.uk

For all our support resources please visit:
http://craigndave.org/
http://student.craigndave.org/