0% found this document useful (0 votes)
177 views16 pages

My Revision Notes Ocr Gcse Computer Science Third Edition Sample Pages 9781398321144

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
177 views16 pages

My Revision Notes Ocr Gcse Computer Science Third Edition Sample Pages 9781398321144

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

MY

OCR
REVISION
NOTES GCSE (9–1)

COMPUTER
SCIENCE
3RD EDITION
✚ Plan and organise your revision
✚ Reinforce skills and understanding
✚ Practise exam-style questions
COMPUTER SCIENCE

For the J277


specification
OCR GCSE (9–1)

George Rouse
This book draws on material written for and published in OCR GCSE Computer Science,
Second Edition (978 1 5104 8416 0) by George Rouse, Lorne Pearcey and Gavin Craddock.
The publisher would like to thank Lorne Pearcey and Gavin Craddock for permission to
re-use their work in the present volume.

Lorne Pearcey and Gavin Craddock have not written any content specifically for this
revision guide, including the exam-style questions and examiner’s tips.

The Publishers would like to thank the following for permission to reproduce copyright
material.
Photo credits
Figure 1.5.1: Background photograph © Mike Berenson/Colorado Captures/Getty Images
Acknowledgements
Adobe is either a registered trademark or trademark of Adobe in the United States and/or
other countries.
Google and the Google logo are registered trademarks of Google LLC, used with permission.
Microsoft product screenshot(s) used with permission from Microsoft.
Microsoft and Windows are either registered trademarks or trademarks of Microsoft
Corporation in the United States and/or other countries.
Every effort has been made to trace all copyright holders, but if any have been inadvertently
overlooked, the Publishers will be pleased to make the necessary arrangements at the first
opportunity.
Although every effort has been made to ensure that website addresses are correct at time of
going to press, Hodder Education cannot be held responsible for the content of any website
mentioned in this book. It is sometimes possible to find a relocated web page by typing in
the address of the home page for a website in the URL window of your browser.
Hachette UK’s policy is to use papers that are natural, renewable and recyclable products
and made from wood grown in well-managed forests and other controlled sources. The
logging and manufacturing processes are expected to conform to the environmental
regulations of the country of origin.
Orders: please contact Hachette UK Distribution, Hely Hutchinson Centre, Milton Road,
Didcot, Oxfordshire, OX11 7HH. Telephone: +44 (0)1235 827827. Email education@hachette.
co.uk Lines are open from 9 a.m. to 5 p.m., Monday to Friday. You can also order through our
website: www.hoddereducation.co.uk
ISBN: 978 1 3983 2114 4
© George Rouse, Lorne Pearcey and Gavin Craddock 2021
First published in 2021 by
Hodder Education,
An Hachette UK Company
Carmelite House
50 Victoria Embankment
London EC4Y 0DZ
www.hoddereducation.co.uk
Impression number 10 9 8 7 6 5 4 3 2 1
Year 2025 2024 2023 2022 2021
All rights reserved. Apart from any use permitted under UK copyright law, no part
of this publication may be reproduced or transmitted in any form or by any means,
electronic or mechanical, including photocopying and recording, or held within any
information storage and retrieval system, without permission in writing from the
publisher or under licence from the Copyright Licensing Agency Limited. Further details
of such licences (for reprographic reproduction) may be obtained from the Copyright
Licensing Agency Limited, www.cla.co.uk
Cover photo © Patrick P. Palej - stock.adobe.com
Illustrations by Aptara, Inc. and Integra Software Services Pvt. Ltd
Typeset in India by Aptara, Inc.
Printed in India
A catalogue record for this title is available from the British Library.
Get the most from this book

Get the most from this book


Everyone has to decide his or her own revision My Revision Planner 2.4 Boolean logic
90 2.4.1 Boolean logic

strategy, but it is essential to learn your work, review


2.5 Programming languages and integrated development

My Revision Planner

My Revision Planner
Countdown to my exams environments
94 2.5.1 Languages
Exam breakdown
95 2.5.2 The integrated development environment

it and test your understanding. These Revision Notes Section 1 Computer systems Check your understanding answers Exam style question answers

1.1 System architecture Index


9 1.1.1 Architecture of the CPU

will help you to do that in a planned way, topic


12 1.1.2 CPU performance
12 1.1.3 Embedded systems

1.2 Memory and storage


15 1.2.1 Primary storage (memory)

by topic. Use this book as the cornerstone of your


17 1.2.2 Secondary storage
19 1.2.3 Units
20 1.2.4 Data storage
31 1.2.5 Compression

revision and don’t hesitate to write in it – personalise 1.3 Computer networks, connections and protocols
33
41
1.3.1 Networks and topologies
1.3.2 Wired and wireless networks, protocols and layers

1.4 Network security

your notes and check your progress by ticking off 45


47
1.4.1 Threats to computer systems and networks
1.4.2 Identifying and preventing vulnerabilities

1.5 System software

each section as you revise.


50 1.5.1 Operating systems
52 1.5.2 Utility software

1.6 Ethical, legal, cultural and environmental impacts


of digital technology
55 1.6.1 Ethical, legal, cultural and environmental impact

Section 2 Computational thinking, algorithms


and programming

Tick to track your progress


2.1 Algorithms
60 2.1.1 Computational thinking
60 2.1.2 Designing, creating and refining algorithms
64 2.1.3 Sorting and searching algorithms

2.2 Programming fundamentals


70 2.2.1 Programming fundamentals

Use the revision planner on pages 4 and 5 to plan 74


75
2.2.2 Data types
2.2.3 Additional programming techniques

2.3 Producing robust programs

your revision, topic by topic. Tick each box when you


83 2.3.1 Defensive design
4 86 2.3.2 Testing
5

Check your understanding and progress at www.hoddereducation.co.uk/myrevisionnotes OCR GCSE Computer Science Third Edition

have: 321144_FM_MRN_OCR_CS_001-008.indd 4-5 11/12/20 3:16 PM

✚ revised and understood a topic Countdown to my exams Exam breakdown


✚ tested yourself

Countdown to my exams

Exam breakdown
6–8 weeks to go One week to go The specification
✚ Start by looking at the specification – make sure you ✚ Try to fit in at least one more timed practice of an The OCR GCSE Computer Science specification includes a list of all content

✚ practised the exam questions and gone online to


know exactly what material you need to revise and entire past paper and seek feedback from your that can be covered in examinations. This is further split into the contents of
the style of the examination. Use the revision planner teacher, comparing your work closely with the paper 01 and paper 02. Each examination question must cover one or more of
on pages 4 and 5 to familiarise yourself with the mark scheme.
these topics and, more importantly, nothing outside these topics can be asked
topics. ✚ Check the revision planner to make sure you haven’t without further explanation.
✚ Organise your notes, making sure you have covered missed out any topics. Brush up on any areas of
It is vital that you focus your revision on these topics and make sure that you

check your answers.


everything on the specification. The revision planner difficulty by talking them over with a friend or getting
will help you to group your notes into topics. help from your teacher. understand each keyword that is used. A guidance column is included to help
✚ Work out a realistic revision plan that will allow you ✚ Attend any revision classes put on by your teacher. you understand the depth required for each topic.
time for relaxation. Set aside days and times for all Remember, they will be an expert at preparing people
the subjects that you need to study and stick to your for examinations. Key point
timetable. Every topic in the specification could be asked about, but not all topics will be included
✚ Set yourself sensible targets. Break your revision in any particular session. Do not focus too much on any specific topic at the expense of
down into focused sessions of around 40 minutes,

You can also keep track of your revision by ticking


other topics – there may be no questions on that topic in the paper you sit, and there
divided by breaks. These Revision Notes organise the The day before the examination
may be questions on the other topics.
basic facts into short, memorable sections to make
✚ Flick through these Revision Notes for useful
revising easier.
reminders, for example the exam tips, common
mistakes and key points.
The examination structure
✚ Check the time and place of your examination.

off each topic heading in the book. You may find it


OCR’s GCSE Computer Science is split into two examinations, each with a
2–6 weeks to go ✚ Make sure you have everything you need – extra pens different focus:
and pencils, tissues, a watch, bottled water, sweets. ✚ Paper 01 consists of questions asking you to demonstrate and apply
✚ Read through the relevant sections of this book and ✚ Allow some time to relax and have an early night to understanding of key concepts and principles. There are no programming
refer to the exam tips, common mistakes and key ensure you are fresh and alert for the examinations. questions in paper 01.
points. Tick off the topics as you feel confident about
✚ Paper 02 is split into two sections:

helpful to add your own notes as you work through


them. Highlight those topics you find difficult and look
✚ Section A covers a mix of understanding, application and programming.
at them again in detail.
✚ Section B covers purely design and programming skills.
✚ Test your understanding of each topic by working
through the Check your understanding questions in My exams Each paper is 1 hour 30 minutes in length and is worth 80 marks. Each paper
the book. accounts for 50% of your final grade. Both papers must be sat in the final year
Paper 01

each topic.
✚ Make a note of any problem areas as you revise and of your studies (Year 11 for most students).
ask your teacher to go over these in class. Date: ......................................................................................
✚ Look at past papers. They are one of the best ways Time: ...................................................................................... Question types
to revise and practise your exam skills. Write or
Location: ................................................................................
prepare planned answers to the exam style Paper 01
questions provided. Check your answers online at
Paper 02 Expect a range of question types in paper 01 including short answer questions
www.hoddereducation.co.uk/myrevisionnotes.
Date: ...................................................................................... requiring just a few words or even a one-word answer, and questions
✚ Use the Now test yourself activities to try out different
requiring longer descriptions or explanations requiring several full sentences.
revision methods. For example, you can make notes Time: ......................................................................................
using mind maps, spider diagrams or flash cards. Typically these questions are marked by points; for a three or more mark
Location: ................................................................................
✚ Track your progress using the revision planner question, a single sentence is unlikely to contain all the relevant points.
and give yourself a reward when you have Make sure your answer contains as many distinct points as there are marks
achieved your target. available.
The paper will also include some quality of written communication questions.
These are indicated by an asterisk (*) on the question paper next to the
number of marks for the question.
It is vital that you read the question carefully and cover everything asked. If
the question asks for a discussion or justification of something, it is important
that you cover both sides (perhaps negatives and positives, or reasons for or
against something). Precise use of terminology and clear understanding is
also required for high marks. This means that for an eight-mark question, you
do not have to worry about hitting eight distinct points but instead need to
6 concentrate on giving a full and balanced answer. 7

Check your understanding and progress at www.hoddereducation.co.uk/myrevisionnotes OCR GCSE Computer Science Third Edition

321144_FM_MRN_OCR_CS_001-008.indd 6-7 11/12/20 3:16 PM

Features to help you succeed


Exam tip Now test yourself
Expert tips to help polish your exam technique and Activities to encourage note taking and revision.
maximise your chances in the exam

Key point
Common mistake
Further explanation of some important issues.
Common mistakes that candidates make and how to
avoid them.
Exam-style questions
Practice exam questions to consolidate your revision and
Check your understanding
practise your exam skills.
Questions to test your understanding of basic facts.

Definitions of key terms that need additional


explanation are provided where they first appear.
Worked example
Worked examples illustrate methods, calculations and
explanations.

My Revision Notes: OCR GCSE Computer Science


My Revision Planner
My Revision Planner

Countdown to my exams
Exam breakdown

Section 1 Computer systems


1.1 System architecture
9 1.1.1 Architecture of the CPU
12 1.1.2 CPU performance
12 1.1.3 Embedded systems

1.2 Memory and storage


15 1.2.1 Primary storage (memory)
17 1.2.2 Secondary storage
19 1.2.3 Units
20 1.2.4 Data storage
31 1.2.5 Compression

1.3 Computer networks, connections and protocols


33 1.3.1 Networks and topologies
41 1.3.2 Wired and wireless networks, protocols and layers

1.4 Network security


45 1.4.1 Threats to computer systems and networks
47 1.4.2 Identifying and preventing vulnerabilities

1.5 System software


50 1.5.1 Operating systems
52 1.5.2 Utility software

1.6 Ethical, legal, cultural and environmental impacts


of digital technology
55 1.6.1 Ethical, legal, cultural and environmental impact

Section 2 Computational thinking, algorithms


and programming
2.1 Algorithms
60 2.1.1 Computational thinking
60 2.1.2 Designing, creating and refining algorithms
65 2.1.3 Sorting and searching algorithms

2.2 Programming fundamentals


70 2.2.1 Programming fundamentals
74 2.2.2 Data types
75 2.2.3 Additional programming techniques

2.3 Producing robust programs


83 2.3.1 Defensive design
4 86 2.3.2 Testing
2.4 Boolean logic
90 2.4.1 Boolean logic

2.5 Programming languages and integrated

My Revision Planner
development environments
94 2.5.1 Languages
96 2.5.2 The integrated development environment

98 Check your understanding answers


103 Exam-style question answers
108 Index

My Revision Notes: OCR GCSE Computer Science


Countdown to my exams
Countdown to my exams

6–8 weeks to go One week to go

✚ Start by looking at the specification – make sure you ✚ Try to fit in at least one more timed practice of an
know exactly what material you need to revise and entire past paper and seek feedback from your
the style of the examination. Use the revision planner teacher, comparing your work closely with the
on pages 4 and 5 to familiarise yourself with the mark scheme.
topics. ✚ Check the revision planner to make sure you haven’t
✚ Organise your notes, making sure you have covered missed out any topics. Brush up on any areas of
everything on the specification. The revision planner difficulty by talking them over with a friend or getting
will help you to group your notes into topics. help from your teacher.
✚ Work out a realistic revision plan that will allow you ✚ Attend any revision classes put on by your teacher.
time for relaxation. Set aside days and times for all Remember, they will be an expert at preparing people
the subjects that you need to study and stick to your for examinations.
timetable.
✚ Set yourself sensible targets. Break your revision
down into focused sessions of around 40 minutes,
divided by breaks. These Revision Notes organise the The day before the examination
basic facts into short, memorable sections to make
✚ Browse through these Revision Notes for useful
revising easier.
reminders, for example the exam tips, common
mistakes and key points.
✚ Check the time and place of your examination.
2–6 weeks to go ✚ Make sure you have everything you need – extra pens
and pencils, tissues, a watch, bottled water, sweets.
✚ Read through the relevant sections of this book and ✚ Allow some time to relax and have an early night to
refer to the exam tips, common mistakes and key ensure you are fresh and alert for the examinations.
points. Tick off the topics as you feel confident about
them. Highlight those topics you find difficult and look
at them again in detail.
✚ Test your understanding of each topic by working
through the Check your understanding questions in My exams
the book.
Paper 01
✚ Make a note of any problem areas as you revise and
ask your teacher to go over these in class. Date: .......................................................................................
✚ Look at past papers. They are one of the best ways Time:.......................................................................................
to revise and practise your exam skills. Write or
Location:.................................................................................
prepare planned answers to the exam-style
questions provided. Check your answers.
Paper 02
✚ Use the Now test yourself activities to try out different
revision methods. For example, you can make notes Date: .......................................................................................
using mind maps, spider diagrams or flash cards. Time:.......................................................................................
✚ Track your progress using the revision planner
Location:.................................................................................
and give yourself a reward when you have
achieved your target.

6
1.1 System architecture
A computer system consists of hardware and software working together to
process data.
Hardware is the name for the physical components that make up the
computer system.
Software is the name for the programs that provide instructions for the
computer, telling it what to do.
A computer system receives information as an input, processes and stores
that information, and then outputs the results of that processing.
The CPU processes the data.

Input Process Output

Storage

Figure 1.1.1 Input–process–output

1.1.1 Architecture of the CPU


Purpose of the CPU
The purpose of the CPU is to carry out a set of instructions that is contained
in a computer program. The CPU is a collection
of billions of electronic
It does this using the fetch–execute cycle. switches that process data,
✚ Fetch – an instruction in the form of data is retrieved from main memory. execute instructions and
✚ Decode – the CPU decodes the instruction. control the operation of the
✚ Execute – the CPU performs an action according to the instruction. computer.

The CPU operates at high speeds governed by the clock chip. The fetch–execute cycle
✚ The clock chip uses a vibrating crystal to maintain a constant speed. is the basic operation of the
✚ The speed of the clock chip is measured in hertz, Hz (cycles per second) CPU. It continually fetches,
and typically works at up to 4 GHz (four billion cycles per second). decodes and executes
✚ The clock speed is the number of fetch–execute cycles per second. instructions stored in
memory.

Common CPU components and


their function
Arithmetic Logic Unit (ALU)
The ALU carries out the calculations and logical decisions required by the
program instructions that the CPU is processing.
✚ Arithmetic operations, such as add and subtract.
✚ Logical operations, such as AND, OR and NOT, and the result of ‘less than’,
‘greater than’, ‘equal to’ comparisons.
✚ Binary shift operations, which are used for multiplication or division.

My Revision Notes: OCR GCSE Computer Science


Control unit (CU)
The CU co-ordinates the activity of the CPU and memory in order to execute
instructions. It:
✚ sends out signals to control how data moves around the CPU and memory
Section 1 Computer systems

✚ decodes instructions from memory.

Cache memory
The purpose of cache memory is to provide temporary storage that the CPU
can access very quickly.
✚ It stores instructions and data that are used repeatedly or are likely to be
required for the next CPU operation.
Cache memory sits between the processor and main memory (RAM).
✚ The CPU looks in the cache for required data.
✚ If it is not there, it requests it from RAM.
✚ The data is moved into cache before being accessed by the CPU.

Registers
In Von Neumann architecture, data and instructions are stored in the
Von Neumann
same memory.
architecture is the most
Typical Von Neumann architecture uses a number of registers. common organisation of
computer components,
Registers are memory locations within the CPU that hold data temporarily
where instructions and
and can be accessed very quickly. data are stored in the same
Their role in the CPU is to accept, store and transfer data and instructions for place.
immediate use by the CPU.
Four of the registers found in the CPU are the ACC, PC, MDR and MAR. Exam tip
Accumulator (ACC) Questions on these topics
✚ Stores the results of any calculations made by the Arithmetic Logic Unit often require you to know
(ALU). these definitions.
✚ Stores the value of inputs and outputs to and from the CPU.
Program counter (PC)
✚ Keeps track of the memory location (known as an address) for the next
instruction.
✚ The program counter is incremented (increased by 1) to the next memory
location at the fetch stage of the fetch–execute cycle, to allow the program
to be executed line by line.
✚ Program instructions can modify the value in the program counter to alter Exam tip
the flow of the program so that it continues from a new location. You will often be asked
Memory data register (MDR) about what type of
✚ Stores any data fetched from memory or any data that is to be transferred information is held in
each of these registers,
to and stored in memory.
an address or data or an
Memory address register (MAR) instruction. Just saying data
✚ Stores the location in memory (an address) to be used by the MDR – that is, or address is not enough,
where the MDR needs to fetch data from or send data to. you must explain more
about the data or address.
Note: You do not need to know about buses for your examination.
Figure 1.1.2 is a simplified diagram showing the layout of these components,
and how the CPU communicates with memory and input/output devices.

10
Memory

Address bus
Registers
Control bus

1.1 System architecture


PC
ACC Data bus
MAR
MDR

Control
ALU Input/Output
unit

Figure 1.1.2 A CPU with Von Neumann architecture; the arrows represent the flow of
data between components

The fetch–execute cycle in more detail


Fetch
1 Each instruction in a computer program is stored in a particular location
(or address) in memory. The address of the next instruction is copied from
the program counter and placed in the MAR.
2 The MAR now contains a memory address. The control unit fetches the
data that is stored at that address and copies it to the MDR.
3 The program counter is incremented to point to the next instruction to be
processed in the program, ready for the next fetch–execute cycle.
Decode
4 The MDR now contains either data to be processed by the CPU, fetched
from memory, or an instruction. The control unit decodes the instruction
to see what to do.
Execute Exam tip
5 The decoded instruction is executed. This might mean performing a Make sure you know the
calculation using the ALU, locating some data in memory, changing the three main stages of the
program counter value – or something else. fetch–execute cycle and
that the PC is incremented
Once the execute part of the cycle is complete, the next fetch–execute
at the fetch stage.
cycle begins.

Revision activity
Load a web version of Little Man Computer (https://peterhigginson.co.uk/lmc/) and,
from the box marked ‘select’, choose ‘add’. This will load a simple program. Run this
by selecting ‘step’ to see how the fetch–execute process uses the key registers in the
CPU to add together two numbers input by the user.

Check your understanding

1 What is the purpose of the CPU?


2 What are the three main stages in the fetch–execute process?
3 Identify three registers and what type of data they hold during the fetch–execute
cycle.
4 State the key feature of Von Neumann architecture.
Answers on p. 98

11

My Revision Notes: OCR GCSE Computer Science


1.1.2 CPU performance
How common characteristics of CPUs affect
Section 1 Computer systems

their performance
Clock speed Exam tip
The CPU is constantly fetching and executing instructions.
You need to know how all of
The speed at which it does this is determined by an electronic clock. these factors work together
to determine how quickly
The faster the clock speed, the more instructions that can be executed every the computer works.
second.
The clock speed is measured in Hertz; 1 Hz = once per second.

Amount of cache memory


Cache memory is located between the main memory and the CPU.
Key point
It is used to hold data that needs to be accessed very quickly.
Cache memory is
Accessing cache memory is much faster than accessing main memory.
significantly more expensive
The larger the cache memory, the more likely it is that the required data will than main memory (RAM)
have been copied from main memory. and a typical computer
will only have KB of cache
The more cache memory available, the better the performance of
compared to GB of RAM.
the computer.

Number of processor cores Exam tip


In a multi-core CPU there are a number of processor cores each capable of
carrying out the fetch–execute cycle. Having multiple cores does
not necessarily improve
If the program supports multi-cores, the CPU can handle several instructions the performance of the
at the same time. computer. This only works
if the program has been
Check your understanding developed to use multiple
cores and the program
5 Describe the three factors that affect the performance of the computer.
running is capable of being
Answers on p. 98 split into subsections.

1.1.3 Embedded systems


The purpose and characteristics of
embedded systems
An embedded system is a computer system that has a dedicated function as
part of a larger device.
When a computer device is required to perform a single or fixed range of
tasks, it can be engineered to reduce its size and complexity in order to focus
only on these tasks.
Dedicated software will be programmed into the device to complete the
necessary tasks and nothing else.
The reduction of complexity of the hardware and the dedicated nature of the
software will make the device more reliable and cost-effective than using a
general-purpose computer.

12
The main components of a computer are either manufactured onto a single
chip (a microcontroller), or separate circuits for processing and memory are
combined into a larger device.
The embedded system will typically include some ROM (read-only memory)

1.1 System architecture


to store the dedicated program and some RAM to store user inputs and
processor outputs.
Embedded systems have the following characteristics.
✚ Low power so they can operate effectively from a small power source such
as in a mobile phone.
✚ Small size so they can fit into portable devices such as a personal fitness
device.
✚ Rugged so that they can operate in harsh environments such as car engine
management systems or in military applications.
✚ Low cost so that they are suitable for use in mass-produced, low-cost
devices such as microwave ovens.
✚ Dedicated software to complete a single task or limited range of tasks,
such as in computer aided manufacture or control systems.

Examples of embedded systems


Embedded systems are found within common household devices such as:
✚ washing machines
✚ set-top boxes
✚ telephones
✚ televisions
✚ home security and control systems.
Embedded systems are also widely used within larger and more complex Exam tip
systems, such as:
It is useful to think about
✚ car engine management
what data is input and
✚ airplane avionics
output by common devices
✚ computer-controlled manufacturing
with embedded systems
✚ military applications such as guidance systems.
and what is held in ROM and
Embedded systems are frequently connected to the internet via Wi-Fi to RAM. Think also about the
exchange data with third parties or apps on other devices, such as: environment in which the
✚ water meters device operates to identify
✚ energy smart meters which features of the
✚ home security embedded system make
✚ central heating management systems. them appropriate.

Examples of embedded system inputs and outputs:

System Input examples Output examples


washing machine choice of program display progress
water temperature signal to heater
water level signal to water input valve
satnav destination driving instructions
GPS position current location mapped

Check your understanding

6 Describe three features that make an embedded system appropriate for use in a
small drone helicopter.
Answers on p. 98

13

My Revision Notes: OCR GCSE Computer Science


Exam checklist
In this chapter you learned about: How common characteristics of CPUs affect their
performance
The purpose of the CPU
Section 1 Computer systems

✚ Clock speed
✚ To carry out a set of instructions contained in a
✚ Cache memory
computer program using the fetch–execute cycle
✚ Number of cores
Common CPU components and their function
The purpose and characteristics of embedded systems
✚ ALU to carry out arithmetic calculations and logical
✚ Designed for a dedicated function as part of a bigger
decisions
system
✚ CU to decode instructions and control how data moves
✚ Often manufactured as a single chip
in the CPU to execute the instructions
✚ Dedicated hardware and software to perform a limited
✚ Cache memory to temporarily hold instructions and
set of tasks
data that the CPU is likely to need
✚ Programs often uploaded at manufacturing stage
✚ Registers, which are memory locations within the CPU
✚ Limited options to modify the programs
that hold data
✚ Low power consumption
Von Neumann architecture ✚ Small
✚ In Von Neumann architecture, data and instructions are ✚ Rugged
stored in the same memory ✚ Low cost
✚ Four key registers in Von Neumann architecture are:
✚ Accumulator to store the results of calculations
carried out by the ALU
✚ Program counter to hold the address of the next
instruction
✚ Memory data register to hold the data fetched from
memory or to be sent to memory
✚ Memory address register to hold the address of the
next memory location to be accessed

Now test yourself

1 Make a list of the main components of the CPU and what they do.
2 List the stages of the fetch–execute cycle and what happens at each stage.
3 Make a list of the factors that affect the speed of the CPU.
4 List some embedded systems and identify the inputs and outputs.

Exam-style questions

1 A computer is advertised as having a clock speed 2 a) State one item that might be held in the ROM in
of 2.8 GHz, 2.5 MB cache and four cores. an embedded system inside a washing machine. [1]
a) Describe how the clock speed affects the b) State two items of data that might be held in
performance of the computer. [2] RAM in an embedded system inside a washing
b) Describe why having more cache memory will machine.[2]
improve the performance of the computer. [2] c) Describe two important features of an embedded
c) State the purpose of the memory address system that make it appropriate for use in a car
register (MAR). [2] engine management system.  [4]
d) Explain how a multi-core CPU can improve the 3 a) Describe three types of operation carried out by
performance of the computer. [2] the ALU. Give an example for each one. [6]
b) Describe what happens at the fetch stage of the
fetch–execute cycle. [3]
Answers on p. 103

14
INDEX
INDEX

device drivers 51
A C digital signals 29
domain name server (DMS) 38
abstraction 60 cache memory 10, 12
DO WHILE (DO UNTIL) loops 71–2
access rights 47 Caesar cipher 53
DVDs 17–18
accumulator (ACC) 10 case function 75
algorithmic thinking 60 casting 74–5
algorithms 60, 63 CDs 17–18 E
flowcharts 62 censorship 57
inputs, processes and central processing unit (CPU) editors 96
outputs 61 architecture 9–11 electronic keys 83
pseudocode 63 performance 12 embedded systems 12–13
searching 65–6 purpose 9 encapsulation 42
sorting 66–9 characters 74 encryption 41, 47, 53
structure diagrams 61 character sets 26–7 environmental issues 56
trace tables 62 checksums 42 error diagnostics 96
analogue signals 29 client–server networks 35–6 error identification 86–7, 88
AND 73–4 clock speed 12 error rate 35
AND gate 90 closed-circuit television (CCTV) 56 Ethernet 41
AND and NOT gate 91 cloud computing 39 ethical issues 55
AND and OR gate 91 colour depth 28–9 examination structure 7
anti-malware software 47 colour representation 28
application software 50 command line interfaces (CLIs) 51
arithmetic logic unit (ALU) 9 comments 85 F
arithmetic operators 72–3 compilers 95
facial recognition 56
arrays 78–9 compression 31
fetch–execute cycle 9, 11
ASCII conversion function 75 computational thinking 60
fibre-optic cables 37
ASCII system 26 Computer Misuse Act 1990 58
file handling 76
assembly languages 94 concatenation 75
file management 52
assignment 70 condition-controlled loops 71–2
file sizes 20
automatic number plate recognition constants 70
images 29
(ANPR) 56 control unit (CU) 10
sound 29–30
copper cables 37
text 27
Copyright, Designs and Patents Act
B 1988 58
File Transfer Protocol (FTP) 42
final/terminal testing 86
count-controlled loops 71
bandwidth 34 firewalls 47
Creative Commons 59
binary 20 flags 66
cultural issues 55
addition 22 flash memory 17
conversion to/from denary 21 float 74
conversion to/from hexadecimal 24 D flowcharts 62
binary codes 26 flowchart symbols 62
binary search 65–6 data capacity calculations 20 fragmentation 19, 53
binary shifts 25 data compression 31, 54 functions 79–80
biometric data 47, 83 data interception 46
bit depth 29–30 prevention methods 48
bits (b) 19 Data Protection Act 2018 57–8 G
black box testing 86 data representation
graphical user interfaces (GUIs) 50
Bluetooth 37, 41 characters 26–7
Blu-Ray 17–18 images 27–9
Boolean data type 74, 90 sound 29–30 H
Boolean operators 73–4 data storage, units 19
combining logic gates 91 data types 74–5 hacking 58
simple logic diagrams 90 Boolean 90 hacktivists 46
use in problem solving 92 decomposition 60 hardware 9
botnets 46 defensive design 83–5 hexadecimal (hex) 23
brute force attacks 46 defragmentation 19, 53 conversion to/from binary 24
prevention methods 48 denial of service (DoS) attacks 46 conversion to/from denary 23
bubble sort 66, 69 prevention methods 48 hierarchical files systems 52
108 bytes (B) 19 destructive testing 86 high-level languages 94–5
Hypertext Transfer Protocol memory address register (MAR) 10 pharming 46
(HTTP) 42 memory data register (MDR) 10 phishing 45
Hypertext Transfer Protocol Secure memory management 51 pixelation 29
(HTTPS) 42 merge sort 67, 69 pixels 27
mesh network topology 40 Post Office Protocol (POP) 42

INDEX
I metadata 28
mnemonics 94
pretexting 45
pretty printing 96
image metadata 28 modular programming 86 primary storage 15–16
image representation 27–9 modulus (MOD) 72 privacy issues 56–7
indentation 85 most significant bit (MSB) 20 procedures 79–80
input–process–output 9 processing 61
processor cores 12
inputs 13, 61
input validation 83
N program counter (PC) 10
insertion sort 66–7, 69 programming languages
network diagram 38
integers 74 high-level 94–5
network interface controllers (NIC) 36
integrated development environment low-level 94, 95
network policies 47
(IDE) 96 proprietary software 58, 59
networks
internet 38–9 protocols 42
client–server 35–6
internet hosts 38 pseudocode 63
factors influencing performance
Internet Message Access Protocol 34–5
(IMAP) 42
Internet Protocol (IP) 38, 42
hardware 36–7 Q
internet 38–9
Internet Protocol addresses 41 IP and MAC addressing 41 question types 7–8
interpreters 95 LANs and WANs 33–4 quotient (DIV) 72
iteration 71–2 layers 42–3
iterative testing 86 mesh topology 40
peer-to-peer 36 R
L protocols 42
random access memory (RAM) 15–16
standards 42
random number generation 80
layers 42–3 star topology 39
ransomware 45
least significant bit (LSB) 20 wired and wireless 41
read-only memory (ROM) 15
legal issues 55 network security
real numbers 74
Computer Misuse Act 1990 58 forms of attack 45–6
records 77
Copyright, Designs and Patents Act identifying and preventing
registers 10
1988 58 vulnerabilities 47–8
resolution of an image 29
Data Protection Act 2018 57–8 nibbles 19
routers 37
software licences 58–9 nodes 37
run-time environment 96
length function 75 NOT 73
linear search 65, 66 NOT gate 90
local area networks (LANs) 33 S
logic circuits 90
combining logic gates 91 O sample rates 29–30
creation from expressions 91–2 searching algorithms
one-dimensional arrays 78
problem solving 92 binary search 65–6
open-source software 58–9
logic errors 87 linear search 65, 66
operating systems 50–2
loops (iterations) 71–2 secondary storage 17–18
operators
lossy and lossless compression 31, 54 fragmentation 19
arithmetic 72–3
low-level languages 94, 95 selection 71
Boolean 73–4
sequence 70–1
optical storage 17–18
M OR 73
servers 35
shouldering 45
OR gate 90
machine code 94 Simple Mail Transfer Protocol (SMTP)
outputs 13, 61
magnetic storage 17, 18 42
overflow errors 25
maintainability 84 social engineering 45
malware 45 prevention methods 48
prevention methods 48 P social media, privacy issues 57
man in the middle attacks 46 software 9
Media Access Control (MAC) packets 37 software licences 58–9
addresses 36, 41 packet sniffing 46 solid-state drives (SSDs) 17, 18
memory passwords 47, 83 sorting algorithms 69
cache memory 10, 12 peer-to-peer networks 36 bubble sort 66
primary storage 15–16 penetration testing 47 insertion sort 66–7
RAM and ROM 15 peripheral management 51 merge sort 67–8
personal identification numbers sound sampling and storage 29–30
secondary storage 17–19 109
virtual 16 (PINs) 46 spyware 45

My Revision Notes: OCR GCSE Computer Science


SQL injection 46
prevention methods 48
purpose 86
refining algorithms 87–8
V
standards 42 types 86 validation 83
star network topology 39 trace tables 63 variables 70
string manipulation 75 translators 95, 96
INDEX

virtual machines 96
strings 74 Transmission Control Protocol virtual memory 16
structure diagrams 61 (TCP) 42 viruses 45
Structured Query Language transmission errors 35 volatile and non-volatile memory 15
(SQL) 46, 77 transmission media 34, 37 Von Neumann architecture 10–11
subprograms 79–80, 84 Trojans 45
subroutines 62 trolling 55
substring function 75 truth tables 90–2 W
switches 37 two-dimensional arrays 78
syntax 63 two-factor authentication 83 web hosting companies 38
syntax errors 86–7 WHILE loops 71–2
system software 50 wide area networks (WANs) 33–4
operating systems 50–2 U internet 38–9
utility software 52–4 Wi-Fi 37
Unicode 26–7 Windows, Icons, Menus and Pointers
user access rights 47 (WIMP) interfaces 50
T user authentication 83 wired and wireless networks 41
user interfaces 50–1 wireless access points (WAP) 37
tables 77 user management 52 Wireless Access Protocol 2/3
test data 87 usernames 83 (WAP 2/3) 47
testing utility software 52–4 worms 45
error diagnostics 96
error identification 86–7, 88

110
OCR GCSE (9–1)
COMPUTER SCIENCE
Target exam success with My Revision Notes. Our updated approach to revision
will help you learn, practise and apply your skills and understanding. Coverage of
key content is combined with practical study tips and effective revision strategies
to create a guide you can rely on to build both knowledge and confidence.
My Revision Notes: OCR GCSE (9–1) Computer Science will help you:

Strengthen subject knowledge Test understanding and identify


and key terms by working through areas for improvement with ‘check
clear and focused key content your understanding’ questions

Check your understanding Open-source software Proprietary software


access to the source code no access to source code
11 Convert the following denary numbers to hexadecimal.
may be free of charge almost always some cost involved
a) 91 b) 173 c) 247
Section 1 Computer systems

1.6 Ethical, legal, cultural and environmental impacts of digital technology


users can modify the software user cannot modify the software
12 Convert the following hexadecimal numbers to denary.
a) 5A b) AB c) B7 can be installed on as many computers extra licences must normally be obtained
as necessary before installing on another computer
Answers on p. 98
no one is responsible for any problems full support from the software developer
with the software
Converting between binary and hexadecimal usually only community support commercial and community support available

Computer scientists use hexadecimal because binary numbers are more difficult Creative Commons is an organisation that issues licences allowing a user to
to work with and remember. For example, 11011011 in hexadecimal is DB. This is modify or distribute parts of the software under certain conditions. It is also
far easier to remember and communicate without introducing errors. known as ‘some rights reserved’.

Hexadecimal to binary Typically, the authors might insist that the software is only used without
payment in a non-commercial setting or that any use of the software includes
To convert from hexadecimal to binary:
statements that attribute the software to the original developers.
✚ convert each hex symbol to the equivalent binary
✚ combine both 4-bit binary numbers (nibbles) into an 8-bit binary number.
Check your understanding
Worked example 4 State which law makes it illegal to distribute a virus.
Convert CF in hexadecimal to binary. 5 Explain what is meant by data minimisation in the Data Protection Act.
6 Describe what is meant by Creative Commons.
Hex C F
Denary 12 15 Answers on p. 100

Enhance exam technique Binary 1100 1111

CF in hexadecimal is 1100111 in binary.


Exam checklist

through exam-style
Ethical, legal, cultural and environmental impact
✚ Impacts of digital technology on wider ✚ Legislation relevant to computer
Binary to hexadecimal Exam tip society science

questions and tips from


To convert from binary to hexadecimal: ✚ Ethical issues ✚ Data Protection Act
This may be easier by
✚ if the binary number has fewer than 8 bits, add leading 0s to make it 8 bits ✚ Legal issues ✚ Computer Misuse Act

Check your answers to


converting to denary before
✚ split into two nibbles ✚ Cultural issues ✚ Copyright, Designs and Patents
converting to hex.

leading author George


✚ convert each nibble to the hex equivalent. ✚ Environmental issues Act
✚ Privacy issues ✚ Software licencing
Worked example
the practice questions
Rouse 1011101

against the answers


Now test yourself
Add leading 0s to make it 8 bits and divide into two nibbles.
1 State the seven key principles of the Data Protection Act 2018.
0101 1101

provided
2 List two other acts and their purpose.
Binary 0101 1101
3 List the differences between open source and proprietary software.
Denary 5 13
Hex 5 D
Exam-style questions
1011101 in binary is 5D in hexadecimal.
1 Karen runs a small business with four employees, each with their own computer
workstation connected to the internet. Exam tip
Check your understanding a) Karen is thinking about using open-source software. Discuss the issues
she needs to consider before making a decision. [4] If an exam question says
13 Convert the following hexadecimal numbers to binary.
b) Karen is concerned about staff using the internet for personal use ‘discuss’, you should look
a) 8C b) 5B c) FE at more than one aspect of
while at work. Explain why she might have concerns about this. [4]
14 Convert the following binary numbers to hexadecimal. the topic, for example look
2 Discuss the environmental impact of widespread computer use. [8]
a) 10100011 b) 11001010 c) 1001110 at positive and negative
Answers on p. 105 aspects.
Answers on p. 98

24 59

My Revision Notes: OCR GCSE Computer Science

321144_1.2_MRN_OCR_CS_015-032.indd 24 29/01/21 1:13 PM 321144_1.6_MRN_OCR_CS_055-059.indd 59 17/02/21 1:17 PM

Plan and manage a successful revision programme with


the ‘exam breakdown’, ‘countdown to the exams’ and
‘now test yourself’ sections

This title is also available


as an eBook with learning
support.
Visit hoddereducation.co.uk/boost
to find out more.

You might also like