ZIMSEC A-Level Computer Science
6Algorithm Design and Data Structures
Overview
Form 5 (competency matrix 8.6) and Form 6 (8.11). Paper 1 weighting 15%; part of the Paper 2 section Programming, Algorithm design and Databases (40%).
In this topic
- 6.1 Pseudocode structures: selection and repetition
- 6.2 Analysing algorithms with trace tables
- 6.3 Standard algorithms: sorting (bubble sort, quick sort) and linear search
- 6.4 Standard algorithms: binary search
- 6.5 Data structures: dynamic and static
- 6.6 Binary trees and array operations
- 6.7 Primitive data types
- 6.8 Recursion
Lessons
- Full access
Computational thinking and designing algorithms
55 min
- Full access
Dry runs, trace tables and finding errors in algorithms
55 min
- Full access
Linear search and bubble sort
60 min
- Full access
Quick sort
55 min
- Full access
Binary search and insertion sort
60 min
- Full access
Abstract data types: stack, queue and linked list
60 min
- Full access
Binary trees and their algorithms
65 min
- Full access
Data types and records
55 min
- Full access
Recursion
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 Algorithm Design and Data Structures into a strength.
Practise with instant marking, see your mastery grow and get a study plan built around your exam date.