CAMBRIDGE

Primary Computing
Learner’s Book 5
Ceredig Cattanach-Chell,
Yianni Dimitriadis & Bernie Fishpool
Endorsement statement
Endorsement indicates that a resource has passed Cambridge International’s rigorous
quality-assurance process and is suitable to support the delivery of a Cambridge
International curriculum framework. However, endorsed resources are not the only
suitable materials available to support teaching and learning, and are not essential to be
used to achieve the qualification. Resource lists found on the Cambridge International
website will include this resource and other endorsed resources.

Any example answers to questions taken from past question papers, practice questions,
accompanying marks and mark schemes included in this resource have been written
by the authors and are for guidance only. They do not replicate examination papers.
In examinations the way marks are awarded may be different. Any references to
assessment and/or assessment preparation are the publisher’s interpretation of the
curriculum framework requirements. Examiners will not use endorsed resources as a
source of material for any assessment set by Cambridge International.

While the publishers have made every attempt to ensure that advice on the qualification
and its assessment is accurate, the official curriculum framework, specimen assessment
materials and any associated assessment guidance materials produced by the awarding
body are the only authoritative source of information and should always be referred to
for definitive guidance. Cambridge International recommends that teachers consider
using a range of teaching and learning resources based on their own professional
judgement of their students’ needs.

Cambridge International has not paid for the production of this resource, nor does
Cambridge International receive any royalties from its sale. For more information about
the endorsement process, please visit www.cambridgeinternational.org/endorsed-resources

Cambridge International copyright material in this publication is reproduced under licence

and remains the intellectual property of Cambridge Assessment International Education.

Third party websites and resources referred to in this publication have not been endorsed
by Cambridge Assessment International Education.

3
 Introduction

Introduction
Welcome to Stage 5 of Cambridge Primary Computing!
The world of computing is incredibly exciting. Many of the things you see
around you every day are linked to computing.
In this book you will:
• plan and develop computer programs in Scratch using selection
and operators
• learn how to collect, store and use data
• investigate networks and how data travels over the internet
• learn how data is saved in a computer system
• find out about artificial intelligence (AI) and how it is used.
These computing ideas affect our daily lives. Learning about them will
help you to see how computers are a part of the world we live in now and
how they might impact it in the future. Many of these ideas can be used
both in the classroom and outside of school.
This book has lots of activities and questions
where you can work with a partner or a group.
Sharing your ideas with others is fun and helps
you to explore the ideas in the book. Maybe you
can share your knowledge with other friends
and family who have not learnt about computing.
There is also a project for you to complete at the
end of each unit. The projects will help you to use
and share what you have learnt in each unit.
We hope that these topics will inspire you to
learn more about computing and to keep learning
about computers as you grow older.
You may even think about getting a job in
computing and help to shape the future of
computing in the world!

Ceredig Cattanach-Chell, Yianni Dimitriadis

and Bernie Fishpool

4
 Contents

Contents
How to use this book 6

1 Computational thinking and programming

1.1 Assigning variables 9
1.2 Using operators 26
1.3 Selection 43
1.4 Planning solutions 60
1.5 Object interaction 76
1.6 Creating user-friendly programs 91
1.7 Using selection with a physical device 105

2 Managing data
2.1 Collecting and storing data 121
2.2 Representing data 139
2.3 Using data 169

3 Networks and digital communication

3.1 Network hardware 181
3.2 How data travels through networks 189
3.3 Network failure 204

4 Computer systems
4.1 Input and output devices 213
4.2 How is data stored? 228
4.3 Processing data 239
4.4 Artificial intelligence (AI) 247

Glossary 259
Acknowledgements 269
Note for teachers: Throughout the resource there is a symbol to indicate where additional digital only content is
required. This content can be accessed through the Digital Learner’s Book on Cambridge GO. It can be launched
either from the Media tab or directly from the page. The symbol that denotes additional digital content is: .
The source files can also be downloaded from the Source files tab on Cambridge GO. In addition, this tab contains
a teacher guidance document which supports the delivery of digital activities and programing tasks in this
Learner’s Book.

5
 How to use this book

How to use this book

In this book you will find lots of different features to help your learning.

What you will learn in

the topic.

Important words
to learn.

A reminder about what you

already know and an activity
to start you off.

Fun activities about computing.

Sometimes, you will use
a computer.

Some activities don’t need a

computer. These are called
unplugged activities. They help
you to understand important ideas
about computing.

Sometimes, you will see

this question. It will help
you to think about your work.

6
 How to use this book

Tasks to help you to practise

what you have learnt.

Programming tasks
are in Unit 1.

Practical tasks are

in Unit 2.

Look out for this icon. You are

going to do an activity at the
computer using a source file or
website link. This content can be
found in the Digital Learner’s Book
on Cambridge GO. Your teacher
will help you to get started.

Questions that help you to

practise what you have just
learnt. Are you ready to move on?

Things to remember when

you are doing a task.

Interesting facts connected

to the topic.

7
 How to use this book

Questions to help you think

about how you learn.

What you have learnt

in the topic.

At the end of each unit, there

is a project for you to carry out,
using what you have learnt.
You might make something
or solve a problem.

Questions that cover what you

have learnt in the unit. If you can
answer these, you are ready to
move on to the next unit.

8
1 Computational
thinking and
programming
1.1 Assigning variables
We are going to:
• define a variable as something that holds a value that can change
• identify that algorithms hold values that can change
• assign (give) variables to values such as text or numbers
• create variables with meaningful names to hold values in algorithms
• modify an existing variable in Scratch and make a new variable to hold
a value that can change.

assign temporary variable

meaningful value variable assignment

Getting started

What do you already know?

• Algorithms are sets of instructions, written in a specific order.
• You can use indefinite loops and count-controlled loops to repeat
instructions, like the same steps of a dance or a verse in a song.

9
 1 Computational thinking and programming

Continued
Now try this!

You will need: a pen and paper

You are going to write an algorithm that gets the ladybug to the bug hotel.

1 Write the instructions for the ladybug as a linear algorithm.

The ladybug understands the following instructions: Move forward;
Turn right; Turn left.
2 Write the instructions using a count-controlled loop to make the
algorithm shorter.

Introducing variables
In an algorithm or a program, a variable stores data that can change.
The data that variables store can be set and changed throughout the
running of a program. We can use variables to store data and then return
to use them later. Variables can only store one item of data at a time.
Look at the algorithm that you wrote to get the ladybug to the bug
hotel. Use the grid in the Now try this! activity to help you. The algorithm
uses a count-controlled loop.

10