153. OCR A Level (H046-H446) SLR25 – 2.3 Representing, adding & removing from queues & stacks

About this video

OCR Specification Reference
AS Level 2.3.1e
A Level 2.3.1e

This video starts by showing you in a visual way how to represent a stack and queue and then talks you though the pseudocode for adding items to and removing items from these data structures.

Key question:

- Can you successfully implement adding data to and removing data from both stacks and queues using a high-level programming language of your choice?

00:00 Representing, adding data to and removing data from queues and stacks
00:09 Intro
00:14 Representing, adding data to and removing data from queues and stacks
00:43 A note from the exam board
01:17 Stacks and queues recap
04:25 Implementing stacks and queues
06:44 Key question
06:59 Essential algorithms for A Level Computer Science text book
08:04 Outro

Last updated: 28.07.26

Other videos on this course