Close

Our School App Stay connected on the go...

Open

Computer Science

GCSE

Please find below some guidance for Computer Science GCSE to support students with the ECA and summer revision.

Course title:

OCR GCSE Computer Science (9-1) - J277

Course page:

https://www.ocr.org.uk/qualifications/gcse/computer-science-j277-from-2020/

Specification:

https://www.ocr.org.uk/Images/558027-specification-gcse-computer-science-j277.pdf

Revision resources:

Advance information topics:

1.1 Systems architecture

1.1.1 Architecture of the CPU

The purpose of the CPU

Common CPU components and their features. 

Von Neumann architecture

1.2 Memory and storage

1.2.1 Primary storage (Memory)

All subtopics to be covered 

1.2.2 Secondary storage

All subtopics to be covered

1.2.3 Units

The units of data storage

1.2.4 Data Storage

Numbers.

Characters

Images

Sound

1.2.5 Compression

All subtopics to be covered

1.3 Computer networks, connections and protocols

1.3.1 Networks and topologies

Factors that affect the performance of networks. 

The hardware needed to connect stand-alone computers into a Local Area Network. 

The Internet as a worldwide collection of computer networks.

1.3.2 Wired and wireless networks, protocols and layers

Modes of connection

Encryption

IP addressing and MAC addressing

Standards

Common protocols

1.4 Network security

1.4.2 Identifying and preventing vulnerabilities

Common prevention methods.

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

1.6.1 Ethical, legal, cultural and environmental impact 

Impacts of digital technology on wider society. 

Legislation relevant to Computer Science.

A Level

Please find below some guidance for Computer Science A Level to support students with the ECA and summer revision.
Course title:

OCR A-level Computer Science - H446

Course page:

https://ocr.org.uk/qualifications/as-and-a-level/computer-science-h046-h446-from-2015/

Specification:

https://www.ocr.org.uk/Images/170844-specification-accredited-a-level-gce-computer-science-h446.pdf

Revision resources:

Advance information topics:

Paper 1

1.1.1 Structure and function of the processor 

(b) The Fetch-Decode-Execute Cycle, including its effect on registers 

(d) The use of pipelining in a processor to improve efficiency 

(e) Von Neumann, Harvard and contemporary processor architecture 

1.1.2 Types of processor 

(a) The differences between and uses of CISC and RISC processors 1.2.1 Systems Software 

(d) Scheduling: round robin, first come first served, multi-level feedback queues, shortest job first and shortest remaining time 

1.2.2 Applications Generation 

(d) Translators: Interpreters, compilers and assemblers 

(e) Stages of compilation (lexical analysis, syntax analysis, code generation and optimisation) 

1.2.4 Types of Programming Language 

(c) Assembly language (including following and writing simple programs with the Little Man Computer instruction set). See appendix 5d 

1.3.2 Databases 

(d) SQL – Interpret and modify. See appendix 5d 

(f) Transaction processing, ACID (Atomicity, Consistency, Isolation, Durability), record locking and redundancy 

1.3.3 Networks 

(b) The internet structure: 

 • The TCP/IP Stack 

1.4.1 Data Types 

(f) Convert positive integers between Binary Hexadecimal and denary 

(g) Representation and normalisation of floating point numbers in binary 

(j) How character sets (ASCII and UNICODE) are used to represent text

Paper 2

2.1.1 Thinking abstractly 

(a) The nature of abstraction 

(b) The need for abstraction 

2.1.2 Thinking ahead 

(c) The nature, benefits and drawbacks of caching 

(d) The need for reusable program components 

2.2.1 Programming techniques 

(b) Recursion, how it can be used and compares to an iterative approach 

(c) Global and local variables

(d) Modularity, functions and procedures, parameter passing by value and by reference 

(e) Use of an IDE to develop/debug a program 

(f) Use of object oriented techniques 

2.2.2 Computational methods 

(f) Learners should apply their knowledge of: 

 • performance modelling 

 • visualisation to solve problems 

2.3.1 Algorithms 

(e) Algorithms for the main data structures, (stacks, queues, trees, linked lists, depth-first (post-order) and breadth-first traversal of trees)