Computer Science

Help using Oak

Year 1

Year 2

Year 3

Year 4

Year 5

Year 6

Primary

Year 7

Year 8

Year 9

Year 10

Year 11

Secondary

Who we are

Meet the team

Oak's curricula

Get involved

Contact us

About us

AI experiments

Curriculum

Plan a lesson

Blogs

Webinars

Help

Guidance

Art and design

Computing

Cooking and nutrition

Design and technology

Drama

English

Financial education

Geography

History

Maths

Music

Physical education

Religious education

RSHE (PSHE)

Science

French

Spanish

Expressive arts and design

Literacy

Personal, social and emotional development

Understanding the world

EYFS

Citizenship

German

Latin

Biology

Chemistry

Citizenship (Core)

Citizenship (GCSE)

Combined science

Computing (Core)

Computer Science (GCSE)

Physical education (Core)

Physical education (GCSE)

Physics

Religious education (GCSE)

High and low level languages

Features of an IDE

Input and output

Developing programs using sequence

Variables and constants in programs

Common data types

Programming project: sequence I

Programming project: sequence II

In this unit pupils will discover computers process instructions. They will recognise the function and tools IDEs provide for developing code and start to develop Python programa which follow a sequence. Pupils will create programs which deal with input and output and make variables to store values.

Programming: sequence

Computational thinking

Comparing algorithms to computer programs

Representing algorithms using flowcharts

Representing algorithms using pseudocode

Tracing algorithms

Data structures

Algorithmic bias

Tackling a project using computational thinking

In this unit pupils will discover the computational thinking techniques; decomposition, abstraction and algorithmic thinking. They will reflect on differences between algorithms and computer programs and explore how algorithms can be represented. Pupils will explore the impact of algorithmic bias.

Algorithms

Using selection when developing programs

Arithmetic operators

Relational operators

Logical operators

Nested selection

Good programming practices

Selection challenge

Programming project: selection I

Programming project: selection II

In this unit pupils will explore the benefits of good programing practices and why subroutines are used in programs. They will create conditions in programs which use arithmetic, relational and logical expressions. They will develop their understanding of selection and explore nested selection.

Programming: selection

Software and embedded systems

Operating system

The processor

The fetch-execute (FE) cycle

Main memory

Secondary storage

Computer specifications

Environmental impacts of computing devices

In this unit pupils will discover the difference between general purpose and embedded systems. They will examine computer architecture and the components that make up a processor. Pupils will recognise the need for storage and be able to select a suitable storage device for a given purpose.

Computer Systems

While loops

Using trace tables

For loops

Nested loops

Randomisation

Validating data input in a program

Designing robust programs

Programming project: iteration I

Programming project: iteration II

In this unit pupils discover how iteration is used to replicate parts of a program. They will analyse the difference between count and condition controlled iteration and how trace tables can be used to trace through loops. They will explore data validation techniques and robust program design.

Programming: iteration

Boolean logic and logic gates

Introduction to logic circuits

Logic statements and expressions

Creating logic circuits

Truth tables

Logic gate simulator software

Implementing Boolean logic in Python

In this unit pupils will discover that Boolean logic is a way of describing circuits inside a computer. They will recognise logic gates as the building blocks of processors. They will be able to construct logic diagrams, truth tables and simplify Boolean expressions.

Boolean logic

Structured programs

Procedures in programs

Functions in programs

Global and local variables in programs

Programming project: subprograms I

Programming project: subprograms II

In this unit pupils will be introduced to structured programming. They will explore the differences between functions and procedures and use functions to return values in programs. They will be introduced to the concept of scope and how parameters can be used to reduce the need for global variables.

Programming: subprograms

Why do computers use binary?

Number bases

Binary addition

Binary shifts

Hexadecimal

Hexadecimal number conversions

In this unit pupils will be reminded of how the base-10 number system works before being introduced to the base-2 number system. They will perform conversions between binary and decimal and recognise the rules of binary addition and subtraction. They will be introduced to hexadecimal and its uses.

Representation of numbers

String handling

Substrings

String manipulation

Arrays and lists

List methods

2D arrays and lists

2D lists challenge

Programming project - Sense HAT I

Programming project - Sense HAT II

This unit introduces pupils to string-handling techniques, they will explore how a string can be iterated over using a loop and sliced to create substrings. Pupils will be introduced to arrays and lists and explore the differences between the two. They will manipulate with a variety of list methods.

Programming: strings and lists

Representation using binary sequences

Representing text using ASCII and Unicode

Text file size calculation

Representing bitmap images

Bitmap file size calculation

Representation of sound

Calculation of sound file sizes

Metadata

In this unit, pupils will discover how letters, images and sounds are represented with binary digits. They will also explore the factors that impact the quality of those representations and investigate the effects these quality choices have on file size.

Representation of text, images and sound

Linear search

Binary search

Comparing searching algorithms

Bubble sort

Merge sort

Insertion sort

Coding sorting algorithms

Practice searching and sorting algorithms

In this unit pupils will have opportunities to analyse, interpret, modify, and implement a range of searching and sorting algorithms. They will have the opportunity to compare the features and efficiency of these algorithms and make suggestions about the most suitable algorithm for a given task.

Searching and sorting algorithms

Measurements of storage

The need for compression

Lossy and lossless compression

Compression ratios

Comparing compression algorithms

Practical applications of compression

In this unit pupils will be introduced to the concept of data compression and why it is needed. The will compare lossy and lossless compression methods and their typical uses. They will have the opportunity to compression methods such as run length encoding (RLE) and Huffman coding.

Data compression

Introduction to AI

Machine learning

Predictive vs generative AI

Social and ethical issues of AI systems

Data driven models

Approaches to training machine learning models

Classification

Machine learning engines

This unit introduces pupils to the emerging field of data science. They will explore what AI systems are and the different categories of AI. The concept of machine learning and how models are driven by data will be explored. They will also consider the ethical and wider implications of AI systems.

Data science: AI and machine learning

Computer Science

Choose a unit (13)