Eduqas GCSE Computer Science scheme of work

Lessons

1. The purpose of the CPU
2. CPU components
3. Von Neumann architecture
4. The fetch-decode-execute cycle
5. The CIR and the full cycle
6. CPU performance
7. Additional hardware
8. Embedded systems
9. Bringing it together

By the end, pupils can

• State the purpose of the CPU as fetching, decoding and executing instructions.
• Describe the functions of the ALU, control unit, cache and registers.
• Explain the von Neumann architecture and the stored program concept.
• Describe the purpose of the PC, CIR, ACC, MAR and MDR in the fetch-decode-execute cycle.
• Trace the fetch-decode-execute cycle, showing how register contents change at each stage.

Lessons

1. Data types and binary
2. Hexadecimal
3. Negative numbers
4. Binary arithmetic and shifts
5. Storage units
6. Characters
7. Graphics and sound
8. Compression
9. Bringing it together

By the end, pupils can

• Identify the integer, real, character, string and Boolean data types and choose the right one for given data.
• Convert between denary, binary and hexadecimal, and explain why hexadecimal is used.
• Represent positive and negative integers in sign and magnitude and two’s complement.
• Carry out binary addition and subtraction, and explain overflow, underflow and arithmetic shifts.
• Convert between base 2 storage units from bit to petabyte and calculate data capacity requirements.

Lessons

1. AND, OR and NOT
2. XOR and Boolean notation
3. Truth tables for expressions
4. Solving problems with logical operators
5. Boolean identities
6. Simplifying Boolean expressions
7. Bringing it together

By the end, pupils can

• State the output of AND, OR, NOT and XOR for any combination of inputs.
• Write and read Boolean expressions using the Eduqas notation for AND, OR, NOT and XOR.
• Construct truth tables for Boolean expressions with two and three inputs, using working columns.
• Write Boolean expressions to solve problems described in words.
• Apply logical operators in program conditions and bit by bit to binary patterns and masks.

Lessons

1. Defining algorithms
2. Sequence, selection and iteration
3. Counts, rogue values and trace tables
4. Subroutines and variables
5. String handling and operations
6. Searching algorithms
7. Sorting algorithms
8. Validation and verification
9. Bringing it together

By the end, pupils can

• Define algorithms using Eduqas pseudo-code and flowchart symbols.
• Use sequence, selection and count- and condition-controlled iteration in algorithms.
• Use counts, totals and rogue values, and test algorithms with trace tables.
• Write and call subroutines, and explain local and global variables and self-documenting identifiers.
• Apply string handling, DIV, MOD and the logical operators AND, OR, NOT and XOR.

Lessons

1. High-level languages
2. Low-level languages
3. Choosing the right level
4. Translators
5. Data types, variables and constants
6. Operators
7. Bringing it together

By the end, pupils can

• Describe the characteristics and purpose of high-level languages.
• Describe machine code and assembly language and the characteristics of low-level languages.
• Justify the choice of a high-level or low-level language for a given situation.
• Explain the purpose and appropriate use of assemblers, compilers and interpreters.
• Select suitable data types and use variables, constants and self-documenting identifiers.

Lessons

1. The IDE and its editor
2. Libraries, the linker and the loader
3. Debugging tools
4. Translators
5. The compilation process
6. Programming errors
7. Bringing it together

By the end, pupils can

• Describe what an IDE is and how its editor features help a programmer write code.
• Explain the purpose of libraries, standard functions and subroutines, and the roles of the linker and loader.
• Describe how syntax error detection, error diagnostics, trace, break points, variable watch and the memory inspector help debug a program.
• Explain the purpose of compilers, interpreters and assemblers and choose the appropriate translator for a situation.
• Describe the five principal stages of the compilation process.

Lessons

1. Data structures and records
2. One-dimensional arrays
3. Processing one-dimensional arrays
4. Two-dimensional arrays
5. Choosing data structures
6. File design
7. Bringing it together

By the end, pupils can

• Describe what a data structure is and name the three in the Eduqas specification.
• Design and interpret records, choosing a suitable data type for each field.
• Read and change elements of one-dimensional arrays using indexes that start at 0.
• Use loops to total, average, count and find the largest value in an array.
• Access and process two-dimensional arrays using [row][column] indexes and nested loops.

Lessons

1. The purpose of the operating system
2. Managing the CPU, multi-tasking and interrupts
3. Managing memory and backing store
4. Peripherals, the interface and security
5. Utility software for disks and files
6. Utility software for protection and recovery
7. Bringing it together

By the end, pupils can

• State the purpose of the operating system and list the eight things it manages.
• Compare GUI, command-line, menu-driven and voice interfaces for different users and tasks.
• Explain how the OS manages the CPU and makes multi-tasking possible using scheduling and time slices.
• Describe how the CPU handles an interrupt using an interrupt service routine.
• Explain how the OS manages memory, virtual memory and backing store.

Lessons

1. Networks and their characteristics
2. Network topologies
3. Network hardware
4. Standards and the OSI model
5. Networking protocols
6. Packets and routing
7. DNS, URLs and web browsers
8. Bringing it together

By the end, pupils can

• Describe the characteristics of networks, including LANs, WANs, client-server and peer-to-peer, and their advantages and disadvantages.
• Compare star and mesh topologies with bus and ring topologies.
• Explain the purpose of routers, hubs, switches, bridges, wireless access points and NICs for wired and wireless connectivity.
• Explain the importance of networking standards and the purpose of each layer of the 7-layer OSI model.
• Describe the use of HTTP, HTTPS, SMTP, FTP, TCP, IP, Ethernet and WiFi (802.11) and their place in the OSI model.

Lessons

1. Malware
2. Phishing and social engineering
3. Brute force and denial of service attacks
4. Data interception and SQL injection
5. Penetration testing and network forensics
6. Anti-malware software and firewalls
7. Access levels, passwords and double authentication
8. Encryption
9. Bringing it together

By the end, pupils can

• Describe what malware is and distinguish viruses, worms, Trojans, ransomware and spyware.
• Explain how phishing, blagging and shouldering manipulate people, and how to prevent social engineering.
• Describe brute force and denial of service attacks and explain how to protect against them.
• Explain how data can be intercepted or stolen and how SQL injection attacks a database.
• Describe the purpose of penetration testing and network forensics.

Lessons

1. Ethical, legal and cultural issues
2. Environmental and privacy issues
3. Data protection – GDPR and the Data Protection Act 2018
4. The Computer Misuse Act 1990
5. Copyright, patents and Creative Commons
6. Surveillance and information laws
7. Professional standards
8. Bringing it together

By the end, pupils can

• Explain ethical, legal and cultural issues linked to computer systems, including the digital divide and automation.
• Describe the environmental impacts of digital technology across manufacture, use and disposal, including e-waste.
• Discuss privacy issues caused by data collection and surveillance, weighing safety against privacy.
• Apply the principles of the GDPR and Data Protection Act 2018 to scenarios and describe data subject rights.
• Identify offences under the Computer Misuse Act 1990 and their impact on organisations.