20% found this document useful (5 votes)
2K views

Computer Science Ocr - j277

Here are three examples of each: Input devices: - Mouse - Keyboard - Microphone Output devices: - Monitor - Printer - Speakers Storage devices: - Hard drive - Solid state drive - Optical disc (CD/DVD)

Uploaded by

naseer
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
20% found this document useful (5 votes)
2K views

Computer Science Ocr - j277

Here are three examples of each: Input devices: - Mouse - Keyboard - Microphone Output devices: - Monitor - Printer - Speakers Storage devices: - Hard drive - Solid state drive - Optical disc (CD/DVD)

Uploaded by

naseer
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/ 18

GCSE (9-1)

Computer
Science
OCR J277

S Robson and
PM Heathcote
Contents
Paper 1 – Computer systems
Section 1
Systems architecture, memory and storage  1
Section 1.1 Architecture of the CPU  2
1.2 CPU performance  5
1.3 Memory  8
1.4 Secondary storage  10

Section 2
Data representation  16
Section 2.1 Units of data storage and binary numbers  17
2.2 Binary arithmetic and hexadecimal  20
2.3 Characters  24
2.4 Images  25
2.5 Sound 28
2.6 Compression 29

Section 3
Computer networks, connections and protocols  34
Section 3.1 The Internet and wide area networks  35
3.2 Local area networks  38
3.3 Wireless networking  43
3.4 Client-server and peer-to-peer networks  45
3.5 Standards, protocols and layers 48

Section 4
Network security and systems software  53
Section 4.1 Network threats  54
4.2 Identifying and preventing vulnerabilities  58
4.3 Operating systems  61
4.4 Utility software 64

iv
Section 5
Ethical, legal, cultural and environmental impacts of digital technology67
Section 5.1 Computer systems in the modern world  68
5.2 Ethical, cultural and environmental issues  72
5.3 Legislation and privacy  76

Paper 2 – Computational thinking, algorithms and programming


Section 6
Algorithms  81
Section 6.1 Computational thinking  82
6.2 Searching algorithms  85
6.3 Sorting algorithms  87
6.4 Developing algorithms using flowcharts  92
6.5 Developing algorithms using pseudocode  94
6.6 Interpret, correct or complete algorithms  98

Section 7
Programming  105
Section 7.1 Programming fundamentals 106
7.2 Sequence and selection  111
7.3 Iteration  114
7.4 Arrays  117
7.5 Procedures and functions 120
7.6 Records and files 124

Section 8
Logic and languages  131
Section 8.1 Logic diagrams and truth tables  132
8.2 Defensive design  135
8.3 Errors and testing  138
8.4 Translators and facilities of languages 144
8.5 The Integrated Development Environment 146

v
Paper 1 – Computer systems

Section 1
Systems architecture, memory and storage
1.1 Architecture of the CPU  2
1.2 CPU performance  5
1.3 Memory  8
1.4 Secondary storage  10

Objectives
• Describe the architecture of the CPU 1
• Explain the purpose of the CPU as fetching and executing instructions stored in memory
• Describe what actions occur at each stage of the fetch-execute cycle
• D
 escribe common CPU components and their function: ALU (Arithmetic Logic Unit),
CU (Control Unit), cache, registers
• Explain the role and operation of the following CPU registers used in Von Neumann
architecture: MAR (Memory Address Register), MDR (Memory Data Register), Program
Counter, Accumulator
• Describe how common characteristics of CPUs affect their performance: clock speed,
cache size, number of cores
• Explain the purpose and give typical characteristics and examples of embedded systems
• Explain the need for primary storage
o Describe the key characteristics and purpose of RAM and ROM
o Explain the need for virtual memory
• Describe the need for secondary storage including optical, magnetic and solid state storage
• Compare advantages and disadvantages between each type of storage device/medium
• Discuss data capacity of storage devices and calculate data capacity requirements
• S
 elect suitable storage devices and storage media for a given application and the advantages
and disadvantages of these, using characteristics: capacity, speed, portability, durability,
reliability, cost

Section 1 Systems architecture, memory and storage 1


1.1 – Architecture of the CPU
SECTION 1 SYSTEMS ARCHITECTURE, MEMORY AND STORAGE

Basic computer system model


A computer system is made up of hardware and software. Hardware is any physical component
that makes up a computer. Software is any program that runs on a computer.
Computer systems are all around us. They are not just the PCs on a desk but include
mobile phones, cash machines, supermarket tills and the engine management systems
in a modern-day car.
The diagram below shows the basic model of a computer system.

Memory

CPU
Input (processor) Output

Secondary
1 storage

All computer systems must have a central processing unit (CPU), also called simply the
processor, and at least one input device that gets data from the real world. This could be a
mouse and keyboard on a conventional PC, a temperature sensor (thermistor) in a commercial
greenhouse or the microphone on a mobile phone.
Input devices take real world data and convert it into a form that can be stored on the computer.
The input from these devices is processed and the computer system will generate outputs. The
output device could be, for example, a conventional computer screen, an actuator that opens
or closes a greenhouse window, or the speaker that produces sound on a phone.
The computer must have memory (primary storage), used for holding instructions currently
being executed and data that is being used.
Any computer system will have these four basic components.
The fifth component is secondary storage. The computer system may need to use stored data
to perform the processing and, as a result of processing input, may generate data that is then
stored. Storage devices such as hard disks can hold large amounts of data including databases,
text documents, programs, music files and photographs.

Q1 Name three input, output and storage devices.

2 Section 1 Systems architecture, memory and storage


2.2 – Binary arithmetic and hexadecimal
SECTION 2 DATA REPRESENTATION

Addition of binary numbers


Adding binary works in exactly the same way as adding denary numbers except this time you
carry groups of 2 instead of groups of 10:

Adding in denary Adding in binary


12345 10010
134+ 101+
12479 10111

78235 10011
97+
1 1 1 11 1 +
1 1

78332 11010
Notice that you carry 1 when you get to Notice that: 0+0=0
ten in a column so 5+7=12, write 2 in 0 + 1 or 1 + 0 = 1
that column but carry 1 group of ten.
1 + 1 = 0 carry 1
1 + 1 + 1 = 1 carry 1

Some more examples:

2 10101100
00010001+
00101101
10000101+
00101101
10000111+
10111101 10110010 10110100

Carry out the following binary number additions:


Q6
(a) 00110011 + 01000110
(b) 00010110 + 01110110
(c) 00001111 + 01110011
(d) 00101010 + 01111011
(e) 00011100 + 01110011

Overflow
The biggest number you can represent with 8 bits is 255 (i.e. 128+64+32+16+8+4+2+1).
If you add two binary numbers together that result in a number bigger than 255, it will need
9 or more bits. A computer stores things in memory in a finite amount of space. If you cannot
represent the number in that amount of space because it is too big, then overflow occurs.
For example:
(252) 11111100
(15) 00001111+
(267) 100001011
The computer would need 9 bits to represent 267 so this 9th bit doesn’t fit in the byte allocated.
This is what is meant by an overflow error.

20 Section 2 Data representation


Lossy compression
SECTION 2 DATA REPRESENTATION

Lossy compression is a data encoding method where files are compressed by removing some
of the detail. For example, photographs can be stored using fewer colours so fewer bits are
needed per pixel. This type of compression is used to compress images, audio files and video
files, where it is easy to recognise an image or sound clip even if some data is missing.
A bitmap image (.bmp) is an uncompressed version of an image. If you save the same
photograph as a JPEG file then it is still a high quality image with a colour depth of 24 bits but
some of the data is lost where it is unlikely to be noticed.
Reduction of file size can also be achieved by reducing the colour depth from 24-bit colour, to
8-bit colour, for example. The human eye can tell the difference at this stage. You will see solid
blocks of colour instead of gradual transitions in the photograph.
Here is a section of a photograph enlarged so you can see the difference:

2 24-bit colour 8-bit colour

Lossy compression formats are show below:

Type File suffix Compression Type Explanation

Good for photographs. Colour depth


JPEG .jpg Lossy = 24 bits, RGB, 16.7 million different
colours
Windows Media
.wmv Lossy Uses Windows Media compression
Player
Audio files: Designed for downloading
MP3 .mp3 Lossy music from the Internet. In MP3 format
you could fit 120 songs on a CD.
Video files: Suitable for small low-
MPEG-1 .mpg Lossy
resolution sequences on CD
Video files: Suitable for full-screen, high
MPEG-2 .mp2 Lossy
resolution video on DVD

30 Section 2 Data representation


Exercises
SECTION 2 DATA REPRESENTATION

1. (a) Add the following two 8-bit binary numbers.  [2]


1 0 0 1 1 0 1 1
0 1 0 1 0 1 0 0

(b)  n overflow error can occur when adding two 8-bit binary numbers.
A
Describe what is meant by an overflow error.  [2]
 OCR A451 June 2014 Qu 3

2. The number 73 could be a denary number or a hex number.


(a) If 73 is a hex number, calculate its value as a denary number.
You must show your working.  [2]

(b) If 73 is a denary number, calculate its value as a hex number.


You must show your working.  [2]

3. Numbers can be represented in denary, binary or hexadecimal.


(a) (i) Convert the binary number 01101001 to denary, showing your working.  [2]
(ii) Convert the number 154 to binary.  [2]

(b) The security code for an alarm system is a long binary number which begins
10001111100101111011 …
The technicians prefer to use hexadecimal to enter the security code.
2 (i) When the number is converted into hexadecimal, the first two digits are 8F
as shown below.
Complete the gaps to show the next three digits.
Binary 1000 1111 1001 0111 1011
Hexadecimal 8 F …….. …….. ………  [3]
(ii) Explain why the technicians prefer to use hexadecimal.  [2]
 OCR A451 June 2013 Qu 5

4. (a) Explain why data is stored in computers in a binary format.  [2]

(b) In the ASCII character set, the character codes for the first three capital letters are
given below.
Letter ASCII character code
A 0100 0001
B 0100 0010
C 0100 0011

(i) State how the ASCII character set is used to represent text in a computer. [2]
(ii) Convert the word CAB into binary using the ASCII character set.  [2]
(iii) Explain why the ASCII character set is not suitable for representing text in all the
languages of the world.  [2]
 OCR A451 Jan 2013 Qu 8

32 Section 2 Data representation


Encryption
SECTION 3 COMPUTER NETWORKS, CONNECTIONS AND PROTOCOLS

Encryption is used primarily to protect data in case it has been hacked or accessed illegally. Data
that is being transmitted over the Internet is vulnerable to hackers. For example, someone who
uses an online shopping site will have to type in their payment details, such as a credit or debit
card number, and it is essential that this information is kept secure. If they are paying by PayPal,
they will have to type in their email address and password, which needs to be kept safe from
anyone intercepting the transmission.
Whilst encryption won’t prevent hacking, it makes the data incomprehensible unless the recipient
has the necessary decryption tools.
Encryption terminology
• Plaintext: the original message to be encrypted
• Ciphertext: the encrypted message
• Encryption: the process of converting plaintext into ciphertext
• Key: a sequence of letters, numbers and other characters used to encrypt or decrypt
• Encryption algorithm: the method for encrypting the plaintext

Symmetric encryption
Symmetric encryption uses a secret key which can be a combination of letters, numbers and
other characters. A single key is used to encrypt and decrypt a message and must be given to
the recipient of your message so that they can decrypt and read it.
Cipertext Ciphertext sent Message

3 produced to recipient deciphered

Plaintext Message
Key shared with recipient separately
Key Key

A very simple example of symmetric encryption is the Caesar shift cipher, in which each letter is
replaced by a letter n number of positions further on in the alphabet. The key in this case is 3:

X Y Z A BCDE F GH

Y Z A BCDE F GH I

Q2 Given the key 5, decode the encrypted message KNWJHWFHPJW BNQQ QTXJ

44 Section 3 Computer networks, connections and protocols


5.1 – Computer systems in the modern world
SECTION 5 ETHICAL, LEGAL, CULTURAL AND ENVIRONMENTAL
IMPACTS OF DIGITAL TECHNOLOGY

Computer technology impacts just about everything we do. Here are a few areas to consider.

Communication
We can keep in touch with friends and family all over the world through email, texting, phone
calls and social networking sites. The latest news about world events can be spread instantly. We
can find out whether a train is on time, what’s on at the cinema, or exactly where a friend is at
this moment, using our smartphones.
Can you imagine having to wait months for news of a family member who has emigrated to
another country?

Employment
Computer technology has had a huge impact on employment. Many types of work have
disappeared, and new jobs have been created.
Computer technology has already led to the loss of thousands of different jobs, for example in:
• clerical work
• manufacturing
• journalism
Robots could soon surpass humans in routine legal work, language translation and medical
diagnosis – but plumbers, gardeners and physiotherapists will be hard to replace.

5 Thousands of new jobs have been created as a result of computer technology:


• software and hardware development
• creation of a multitude of new products from robots, ‘smart homes’ and mobile technologies
to online learning materials and aids for disabled people

Name three jobs that you think could be computerised, and five jobs that cannot
Q1 easily be computerised.

Shopping
Online shopping has given customers access to many different products that were traditionally
difficult to purchase, as well as day to day items. This easy access has, in many towns,
contributed to the closing of local and national stores leading to empty shops on the high street.

68 Section 5 Ethical, legal, cultural and environmental impacts of digital technology


Example 4: Insertion sort
SECTION 6 ALGORITHMS

The same list of numbers is sorted into ascending order using an insertion sort:
9, 5, 4, 15, 3, 8, 11, 2

We leave the first item at the start of the list 9 5 4 15 3 8 11 2

5 is now inserted into the sorted list 1st pass 5 9 4 15 3 8 11 2

4 is now inserted into the sorted list 2nd pass 4 5 9 15 3 8 11 2

15 is now inserted into the sorted list (it 3rd pass 4 5 9 15 3 8 11 2


stays where it is)
3 is now inserted into the sorted list 4th pass 3 4 5 9 15 8 11 2

8 is now inserted into the sorted list 5th pass 3 4 5 8 9 15 11 2

11 is now inserted into the sorted list 6th pass 3 4 5 8 9 11 15 2

2 is now inserted into the sorted list 7th pass 2 3 4 5 8 9 11 15

On each pass, the current data item is checked against those already in the sorted list (as
shaded in the diagram). If the data item being compared in the sorted list is larger than the
current data item, it is shifted to the right. This continues until we reach a data item in the sorted

6 list which is smaller than the current data item.


For example, at the 5th pass 8 is compared with 15, and since 8 is smaller, 15 is shifted right.
8 is compared with 9, and 9 is shifted right.
8 is compared with 5, and as 8 is larger, it is inserted into the free space.

5th pass in summary:

8 is removed from the list temporarily 3 4 5 9 15 11 2

Since 15 > 8, it is now shifted to the right 3 4 5 9 15 11 2

Since 9 > 8, it is now shifted to the right 3 4 5 9 15 11 2

Since 5 < 8, 8 is now inserted into the sorted list 3 4 5 8 9 15 40 53

The following list of names is to be sorted into alphabetical sequence using an


Q14 insertion sort. George, Jane, Miranda, Ahmed, Sophie, Bernie, Keith.
(a) What is the first name to be moved? What will the list look like after this
name is moved?
(b) What is the second name to be moved? What will the list look like after this
name has been moved?
(c) How many names have to be moved altogether before the list is sorted?

90 Section 6 Algorithms
Example 8

6.5 DEVELOPING ALGORITHMS USING PSEUDOCODE


A computerised form prompts a user to enter their email address.
The validation rules check if the address has an @ symbol in it. If it doesn’t, an error message is
displayed, the text box is cleared and the system asks the user to enter the email address again.
This continues until an appropriate address is entered.
The system then checks that the email address has been typed in lowercase and if not, it
converts it to lowercase.
Once the email address is ok it is stored in the customer file.
The flowchart for this could be as follows:

START emailAddress = input

while not hasAtSign


input
emailAddress print error message
emailAddress = input
endwhile

if emailAddress is not
lowercase then
emailAddress No display Convert to lowercase
contains @? error message
endif
Yes
Write emailAddress to
emailAddress No convert to
customer file 6
lowercase? lowercase

Yes

write emailAddress
to customer file

END

The if statement to check whether the address is lowercase is not needed. Modify
Q20 the algorithm so that it performs the same task without the if statement.

Write a pseudocode algorithm which inputs 10 numbers. Each time a number less
Q21 than zero is input, the program displays which number it is, and its value. When all
numbers have been input, display the average of all the negative numbers. Your
algorithm should allow for the fact that there may be no negative numbers.
Sample output could be, for example:
Number 3 -8
Number 7 -20
Average of negative numbers = -14

6.5 Developing algorithms using pseudocode 97


• Auto-complete statements

8.5 THE INTEGRATED DEVELOPMENT ENVIRONMENT


• Colour-code key words such as if, then, else, comment statements, text within quotes etc.
The screenshot below shows a program that a user has entered, saved and attempted to run
using the Run command at the top of the screen.

In addition, an IDE will also provide:


• Pretty printing
• Break points to stop the program running at certain points
• Watch windows to monitor changes in variable values
8
What is wrong with the statement? How does the IDE help identify comments,
Q6 keywords, text in quote marks? Can you spot any other syntax errors?

Q7 List some other features of an IDE editor.

Error diagnostics
Once a program has been entered it can be saved and translated to machine code by an
interpreter or a compiler. The interpreter or compiler will run error diagnostics on each line
that the programmer has entered, when they try to run the saved program. The IDE will then
allow them to correct any syntax errors, save the program, translate to object code using the
interpreter or compiler and run it again. When the syntax errors have all been corrected and the
program is run again, the IDE may discover and report a runtime error.

Can you identify the problem? What must be amended to correct the program? There
Q8
are more errors in the program – if you are a Python programmer you can try running
the program.

8.5 The Integrated Development Environment 147


Index

OCR GCSE (9-1) COMPUTER SCIENCE INDEX


Symbols buffering 63 D
3D printing 75 byte 17 data interception 57
word 18 Data Protection Act 2018 76
A data types 106
abstraction 82 C decomposition 83
access levels 60 cables 42 defensive design 135
accumulator 4 cache memory 3, 5, 6 defragmentation software 64
actuators 7 camelCase 137 denary 18
adding in binary 20 capacity 10 to binary 19
algorithm 92 carbon footprint 70 to hexadecima 23
algorithmic thinking 84 case statement 96 Denial of Service (DoS) attack
amplitude 28 casting 109 57
analogue 28 CD 13 digital 28
to-digital converter 28 central processing unit 2 disinformation 74
AND gate 134 character set 24 disk defragmenter 65
application layer 50 chr 111 div 109
Arithmetic Logic Unit 3 ciphertext 44, 64 domain name system 36
arithmetic operations 4, 108 circuits 17 registration 46
arithmetic shift 21 circuit switching 38 dots per inch 27
arrays 117 client-server network 45 do...until 96, 116
artificial intelligence 70 clock speed 5 driverless cars 70
ASCII 24 cloud storage 47 dual-core 6
assembly language 144 coaxial cable 42 durability 10
assignment statement 107
authentication 136
colour depth 25, 26
command-line interface 62
DVD 13 I
comma-separated value 127 E
B comments 138 email server 45
backing store 46 communication 68 embedded system 7
bandwidth 48 comparison operations 108 emojis 25
binary 17 compiler 145 dmployment 68
addition 20 compression 29 encryption 44, 60
shifts 21 lossless 31 asymmetric 45
to denary 18 lossy 30 symmetric 44
to hexadecimal 22 software 65 environmental issues 70
logic 132 computational thinking 82 erroneous data 141
search 86 CAM 71 Ethernet 37, 42
BIOS 9 Computer Misuse Act 1990 76 extended ASCII 25
bit 17 computer system 2
bitmap image 25, 30 concatenation 109 F
blagging 56 constants 107 fake news 74
Bluetooth 37, 43 control unit 3, 4 fetch-execute cycle 3
Blu-ray 13 conversion 18 fibre optic 42
Boolean expressions 112 Copyright Designs and file formats 30
Boolean operators 108 Patents Act 1988 77 file management 64
bootstrap loader 9 cores 6 file server 45
boundary data 141 cost of storage 10 files 124
break points 147 counting in binary 18 File Transfer Protocol (FTP) 46,
brute force attack 56 CPU 2, 5 49
bubble sort 87 cycle, Fetch-Execute 3 firewall 59

OCR GCSE (9-1) Computer Science Index 151


OCR GCSE (9-1) COMPUTER SCIENCE INDEX Index continued
flowcharts 92, 97, 99 K N
format check 136 key 44 naming conventions 137
for...next 96, 114 kibibyte 17 nested
freeware 77 kilobyte 17 if 95
frequency 28 loops 117
functions 121 L network hardware 41
latency 48 networking 39
G layers 50 Network Interface Card (NIC) 41
Gigabyte 17 legislation 76 network interface controller 37
graphical user interface 62 length check 136 network performance 48
linear search 85 network standard 48
H link layer 50 nibble 17, 22
hacking 56, 79 local area network (LAN) 37, 38 NOT gate 133
hard disk drive 8 logical operations 4
hardware 2 logic O
healthcare 73 circuits 134 OCR Exam Reference Language
Hertz 5 diagrams 132 108, 110, 122
hexadecimal 22 errors 139 off-line storage 11
to binary 23 gates 133 open source software 77
to denary 23 loop 114 operating system 9, 59, 61
high-level languages 144 lossless compression 31, 65 optical media 13
hosting 46 lossy compression 30, 65 ord 111
HTTP 49, 61 low-level languages 144 OR gate 134
HTTPS 49, 61 output 84
I hub 39 M
MAC address 37, 42, 50
device 2
statement 107
I machine code 144 overflow 20, 21
identifier 106 magnetic disks 10
if...then...else 95 main memory 3, 62 P
images 25 maintainability 137 packet switching 38
indentation 138 malware 54 parallel processing 6
input 84 man-in-the-middle attack 57 password protection 60
device 2 Mebibyte 17 peer-to-peer 46
statement 107 Media Access Control 37 penetration testing 58
insertion sort 89 Megabyte 17 performance 5
Integrated Development memory 2, 8 peripheral
Environment (IDE) 146 RAM 8 devices 38, 39
interference 42, 48 ROM 9 management 63
Internet 35 virtual 8 phishing 54
Internet layer 50 Memory Address Register 4 physical security 61
Internet Messaging Access Memory Data Register 4 pixels 25
Protocol (IMAP) 49 memory management 62 Pixels Per Inch (PPI) 25
interpreter 145 memory sticks 12 plaintext 44, 64
invalid data 141 merge sort 91 portability 10
IP address 35, 36, 50 mesh network 40 Post Office Protocol (POP) 49
IPv4 35 full 40 presence check 136
IPv6 35 partial 40 pretty printing 147
ISP 46 metadata 27, 78 privacy 76, 78
iteration 96, 114 mod 109 private key 45
multi-tasking 62 procedures 120

152 OCR GCSE (9-1) Computer Science Index


OCR GCSE (9-1) COMPUTER SCIENCE INDEX
processing 84 social networking 73 U
processor 2 software 2 Unicode 25
Program Counter 4 freeware 77 units 17
programming languages 144 licences 77 URL 36, 37
proprietary software 77 open Source 77 user access levels 60
protocols 48 proprietary 77 user interface 7, 61
pseudocode 94 solid state drive 8, 11 user management 63
public key 45 sorting 87 utility software 64
sound 28
Q sample 28 V
quad‑core 6 special-purpose registers 4 validation 60, 136
speed of storage devices 10 variables 106, 122
R SQL 57, 125 vector graphic 25
radio waves 37, 43 injection 57 verification 60, 136
Random Access Memory 5, 8 stakeholder 73 virtual memory 8
random number generation 122 standards 48 virus 54
range check 136 star network 39 volatility 9
reading from a file 127 storage 2, 9, 10 Von Neumann architecture 3
reading records into an array cloud 47 vulnerabilities 58
127 stored program computer 3
Read Only Memory 9 string manipulation 110 W
records 124 structure diagram 83 waste 71
registers 3 sub-program 120, 137 watch windows 147
ACC 4 subroutine 120, 123 web browser 35
MAR 4
MDR 4
switch 17, 39, 41
switch statement 96
web hosting 46
web server 45
I
PC 4 syntax errors 138 while...endwhile 96, 115
reliability 10 system software 145 wide area network 35, 37
resolution 25, 26 WIMP 61
ROM 7 T WinZip 65
router 41 TCP/IP 49 wireless access point 43
TCP/IP model word 18
S layers 50 worm 54
sample rate 28 test data 141 writing to a file 126
sample resolution 28 testing 140
satellites 37 test plan 141
searching 85 text files 126
secondary storage 8, 10 topologies 39
selection 95, 112 mesh 39
sensors 7 star 39
sequence 94, 111 trace table 98, 143
server 45 translators 145
shift 21 transmission errors 48
operations 4 transmission media 42
overflow 21 transport layer 50
shouldering 57 Trojan 54
Simple Mail Transfer Protocol twisted pair copper cable 42
(SMTP) 50 type check 136
smart meters 79
social engineering 54

OCR GCSE (9-1) Computer Science Index 153


OCR
OCR GCSE
GCSE J277 (9-1) Specification map
J277 (9-1) Specification map

4 4

8 8
6 6
2 2

3 3

5 5

7 7
1 1
Section

Section

Section

Section

Section

Section

Section

Section
Section

Section

Section

Section

Section

Section

Section

Section
Paper 1: Computer systems
Paper 1: Computer systems
1.1 Systems architecture 
1.1
1.2
Systems architecture
Memory and storage 
 
1.2
1.3
Memory and storage
Computer networks, connections and protocols   
1.3
1.4
Computer networks, connections and protocols
Network security  
1.4
1.5
Network security
Systems software 

1.5
1.6
Systems software
Ethical, legal, cultural impacts of digital technology  
1.6 Ethical, legal, cultural impacts of digital technology 
Paper 2: Computational thinking, algorithms and programming
Paper 2: Computational thinking, algorithms and programming
2.1 Algorithms 
2.1
2.2
Algorithms
Programming fundamentals  
2.2
2.3
Programming fundamentals
Producing robust programs  
2.3
2.4
Producing robust programs
Boolean logic 

2.4
2.5
Boolean logic
Programming languages and IDEs 

2.5 Programming languages and IDEs 
The content in each section of the textbook covers the same specification points as the corresponding downloadable
The content
teaching unit,ine.g.
each section
Section of the textbook
1 complements covers
Unit 1. the same specification points as the corresponding downloadable
teaching unit, e.g. Section 1 complements Unit 1.

Exclusively for teachers


To accompany each section in the textbook, there is a series of teaching units for the new OCR J277 (9-1) GCSE.
Unit 5 pictured below is free.
OCR GCSE (9-1) J277
Computer
Science
The aim of this book is to About the authors Cover picture:
provide an accessible text Susan Robson worked for
for students, covering the International Computers ‘Love Song’
OCR GCSE (9-1) Computer Ltd after graduating from Acrylic on YUPO, 2012
Science specification J277. Manchester University with a © Sharon Cummings
It will be invaluable both as a degree in Computer Science. www.sharoncummings.wordpress.com
course text and in revision for She spent the following 12
students nearing the end of the years in technical pre-sales for
course. It is divided into eight ECI Telecom, before moving
sections, each broken down into teaching. As a Head of
into manageable chapters of Computer Science, she gained
roughly one lesson. years of experience teaching
GCSE and A Level Computing This book has been
Sections 6 and 7 of the and has written successful endorsed by OCR.
textbook cover algorithms textbooks and teaching
and programming concepts materials. She is currently
with a theoretical approach. teaching Computer Science
This provides students with at King Alfred’s Academy in
experience of writing, tracing Wantage.
and debugging pseudocode
solutions without the aid of Pat Heathcote is a well-known
a computer. These sections and successful author of
would complement practical Computer Science textbooks.
programming experience. She has spent many years as a
teacher of A Level Computing
Each chapter contains in-text courses with significant
questions and exercises, some examining experience. She has
new and some from past also worked as a programmer
examination papers, which and systems analyst, and was
can be set as homework. Managing Director of Payne-
Answers to all these are Gallway Publishers until 2005.
available to teachers only, in
a free Teachers’ Supplement
which can be ordered from
our website
www.pgonline.co.uk

You might also like