Cambridge AS & A Level Computer Science
19.1Algorithms
Algorithms in Cambridge AS & A Level Computer Science: what the syllabus expects you to know, the learning objectives and how to practise.
Subtopic139 practice questions6 lessons
Learning objectives
What the syllabus expects you to be able to do.
- 19.1.1Write algorithms for linear and binary search and for insertion and bubble sort, and explain their performance.
- 19.1.2Write algorithms to insert and delete items in a stack, queue and linked list, and to find items in a linked list and binary tree.
- 19.1.3Describe a graph and a dictionary as ADTs and implement ADTs from built-in types or other ADTs.
- 19.1.4Compare algorithms by time and memory, using Big O notation.
Lessons
- Full access
Binary search and insertion sort
60 min
- Full access
Binary trees and their algorithms
65 min
- Full access
Comparing algorithms and Big O notation
55 min
- Full access
Graphs, dictionaries and implementing ADTs
55 min
- Full access
Linked list algorithms
60 min
- Full access
Stack and queue algorithms
60 min
Join to read every lesson, or see what Full access includes.
Sample question
A sample question on this topic. Answer it, check it, then read the worked answer.
Turn Algorithms into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.