A-Level Computer Science · Syllabus 19.1
Algorithms
Coursebook chapter 19: Computational thinking and problem solving
No chapter review yet. It is on its way.
InteractiveSearching: Linear and Binary Search19.1.1 Animated traces with pseudocode and Python, comparison labs, a binary search game and exam questions.Open →
InteractiveSorting: Bubble Sort and Insertion Sort19.1.2 Step-through sorts, a race on different lists, a bubble sort game and exam questions.Open →
InteractiveAbstract Data Types: Stacks, Queues, Lists, Trees and Graphs19.1.3 Stacks, circular queues, array-based linked lists, binary trees and graphs: animated code, sandboxes and exam questions.Open →
InteractiveGraphs: Representation and Shortest Paths19.1.3 and 19.2 Graph terms, adjacency matrices and lists, Dijkstra and A*, how graphs appear in exams, labs and 10 exam questions.Open →
InteractiveImplementing One ADT from Another19.1.4 Linked lists from arrays, dictionaries from linked lists, simulators and exam questions.Open →
InteractiveComparing Algorithms: Big O Notation19.1.5 Order of growth, comparing algorithms and a practice set.Open →
WalkthroughLinked ListsAbstract data types: how a linked list stores, inserts and deletes nodes using pointers.Open →
Extra activities that deepen understanding or give more support. Shown in syllabus order.
No extra resources for this chapter yet.
WalkthroughInsertion Sort, Step by StepTrace an insertion sort pass by pass and compare it with bubble sort.Open →
WalkthroughBinary Search Tree WalkthroughInsert, search and traverse a binary tree one step at a time.Open →
Deleted: hidden from students and progress. Only you can see this tab.