Algorithms for main data structures A Level Resources

A Level Computer Science: Algorithms for main data structures

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
Algorithms for main data structures A Level Resources Image 1
Algorithms for main data structures A Level Resources Image 2
Algorithms for main data structures A Level Resources Image 3
Algorithms for main data structures A Level Resources Image 4
Algorithms for main data structures A Level Resources Image 5

Download →

Algorithms for main data structures

Algorithms for data structures such as linked lists, stacks, queues, graphs, hash tables, and trees were described in previous topics. In this topic, we will learn in detail about the implementation of graph traversal algorithms. There are two ways of traversing a graph: depth-first search and breadth-first search.

This A Level Computer Science module introduces algorithms for main data structures to your students, explaining:

  • Depth-first traversal algorithm for graphs
  • Breadth-first traversal algorithm for graphs

More Algorithms Modules

Algorithms for main data structures is one lesson in our Algorithms module. The other theory lessons can be found below: