OCR GCSE Computer Science topic introductions are not endorsed by OCR. Please refer to the exam board specification to ensure that the full range of topics has been covered.
To access the course material, please click on the link to each section.
This course is supported by the paperback revision guide, GCSE Computer Science 9-1 Complete Visual Notes for OCR, available on Amazon to help students create a full set of revision notes in both visual and written form.
Paper 1 – Computer Systems
The Computer systems exam covers the non-programming theory topics. This is a 1.5 hour written paper that includes multiple choice, short answer, and longer answer questions.
1.1 Systems Architecture
1.2 Memory
1.3 Storage
- Secondary Storage
- Data Capacity & Calculating Memory Size
- Common Types of Storage
- Characteristics of Storage Types
1.4 Wired & Wireless Networks
- Types of Network
- Factors That Affect The Performance of Networks
- Client-Server & Peer-To-Peer Networks
- Hardware for a Local Area Network (LAN)
- The Internet as a Network
- Virtual Networks
1.5 Network Topologies & Protocols
- Star & Mesh Topologies
- WiFi
- Ethernet
- IP Addresses, MAC Addresses, & Protocols
- Network Layers
- Packet Switching
1.6 System Security
- Forms of Attack
- Threats Posed to Networks
- Identifying & Preventing Vulnerabilities
1.7 System Software
- The Purpose & Functionality of Systems Software
- Operating Systems
- Utility System Software
- Encryption Software
- Defragmentation Software
- Data Compression
- Methods of Backup
1.8 Legal, Ethical, Moral, & Environmental Concerns
- How Key Stakeholders Are Affected by Technology
- Environmental Impact of Computer Science
- Cultural Implications of Computer Science
- Open Source vs. Proprietary Software
- Legislation Related to Computer Science
Paper 2 – Computational Thinking, Algorithms, & Programming
The Computational Thinking exam covers the programming theory topics. The NEA aspect of the course covers much of this, but you will be required to describe the design and development of programs in writing.
This is a 1.5 hour written paper that includes multiple choice, short answer, and longer answer questions.
2.1 Algorithms
- Computational Thinking
- Algorithms (decomposition)
- Efficiency
- Standard Searching Algorithms
- Standard Sorting Algorithms
- Flowcharts
- Pseudocode
- Interpreting Algorithms (Trace Tables)
- Complete or Correct Algorithms
2.2 Programming Techniques
- Use of
- Variables
- Constants,
- Inputs, Outputs, & Assignment
- Programming Constructs
- String Manipulation
- File Handling Operations
- Use of Records to Store Data
- Use of SQL to search for Data
- Use of Arrays
- Use of Sub-Programs:
- Use of Data Types
- Common Arithmetic Operators
- Common Logical Operators
- Common Boolean Operators
2.3 Producing Robust Programs
- Defensive Design Considerations
- Maintainability
- The Purpose of Testing
- Types of Testing
- How to Identify Syntax & Logic Errors
- Selecting & Using Suitable Test Data
2.4 Computational Logic
- Why Data is Represented in Binary Form
- Simple Logic Diagrams
- Truth Tables
- Combining Truth Diagrams
- Applying Truth Tables to Solve Problems
- Applying Computing-Related Mathematics
2.5 Translators & Facilities of Languages
- Characteristics & Purpose of Different Languages
- The Purpose of Translators
- The Characteristics of Assemblers, Interpreters, & Compilers
- Common Tools & Facilities of an IDE
2.6 Data Representation
- Units of Storage
- Number Systems (Binary)
- Number System (Hexadecimal)
- Binary Addition
- Binary Multiplication
- Characters
- Images
- Sound
- Compression