Edexcel GCSE 1CP2 Computer Science: spec coverage
9of 68 spec points have a lesson out now
68have a lesson planned
Spec text is our short form of the board's statement. Always check the board's own specification.
| Spec | Statement | Lesson |
|---|---|---|
| 1.1.1 | Explain the benefit of using decomposition and abstraction to model aspects of the real world and to analyse, understand and solve problems. | CS10-02 Decomposition and abstraction Coming soon |
| 1.1.2 | Explain the benefits of using subprograms. | CS13-06 Why subprograms exist Coming soon |
| 1.2.1 | Algorithms | CS10-04 Flowcharts Coming soonCS10-05 Pseudocode Coming soonCS10-06 Sequence, selection and iteration in an algorithm Coming soon |
| 1.2.2 | Algorithms | CS12-01 Variables, constants and assignment Coming soonCS12-08 Putting the statement types together Coming soonCS13-01 Arrays, one and two dimensional Coming soon |
| 1.2.3 | Algorithms | CS12-04 Arithmetic operators, DIV and MOD Coming soonCS12-05 Relational operators Coming soonCS12-06 AND, OR and NOT in a condition Coming soon |
| 1.2.4 | Determine the correct output of an algorithm for a given data set and use a trace table to find what a variable holds at a given point. | CS10-07 Trace tables Coming soon |
| 1.2.5 | Identify syntax, logic and runtime errors in programs and correct logic errors in algorithms. | CS14-07 Syntax, logic and runtime errors Coming soon |
| 1.2.6 | Algorithms | CS11-01 Linear search Coming soonCS11-02 Binary search Coming soonCS11-04 Bubble sort Coming soonCS11-05 Merge sort Coming soon |
| 1.2.7 | Use logical reasoning and test data to evaluate an algorithm's fitness for purpose and efficiency, counting compares, counting passes through a loop, and considering memory use. | CS10-08 Which algorithm is more efficient? Coming soon |
| 1.3.1 | Apply AND, OR and NOT in truth tables with up to three inputs to solve problems. | CS15-01 AND, OR and NOT as logic gates Coming soonCS15-02 XOR and combining gates Coming soon |
| 2.1.1 | Binary | CS01-01 Why computers use binary WatchCS01-02 Denary to binary and back Watch |
| 2.1.2 | Explain how computers represent and manipulate unsigned integers and two's complement signed integers. | CS01-09 Negative numbers and two's complement Coming soon |
| 2.1.3 | Convert between denary and 8-bit binary, for unsigned 0 to 255 and signed -128 to +127. | CS01-02 Denary to binary and back Watch |
| 2.1.4 | Binary | CS01-06 Binary addition WatchCS01-08 Binary shifts Coming soon |
| 2.1.5 | Explain overflow in relation to the number of bits available to store a value. | CS01-07 Overflow Watch |
| 2.1.6 | Binary | CS01-03 Why hexadecimal exists WatchCS01-05 Binary and hexadecimal Watch |
| 2.2.1 | Explain how computers encode characters using 7-bit ASCII. | CS02-02 Character sets and ASCII WatchCS02-03 Character codes run in order Watch |
| 2.2.2 | Explain how bitmap images are represented in binary, in terms of pixels, resolution and colour depth. | CS03-01 How an image is stored Coming soon |
| 2.2.3 | Explain how analogue sound is represented in binary in terms of amplitude, sample rate, bit depth and sample interval. | CS03-03 How sound is stored Coming soon |
| 2.2.4 | Explain the limitations of binary representation when constrained by the number of available bits. | CS02-06 The limits of a fixed number of bits Coming soon |
| 2.3.1 | Data storage and compression | CS02-01 Bits, bytes and the units of storage WatchCS02-05 Working out the size of a text file Coming soonCS03-04 Working out image and sound file sizes Coming soon |
| 2.3.2 | Explain the need for data compression and compare lossless and lossy methods. | CS03-05 Why we compress data Coming soon |
| 3.1.1 | Hardware | CS04-02 The CPU and the von Neumann model WatchCS04-04 The fetch-execute cycle Watch |
| 3.1.2 | Explain the role of secondary storage and how data is stored on magnetic, optical and solid state devices. | CS05-04 Secondary storage: magnetic, solid state and optical Coming soon |
| 3.1.3 | Explain the concept of an embedded system and what embedded systems are used for. | CS04-06 Embedded systems Watch |
| 3.2.1 | Explain the purpose and functionality of an operating system in file, process, peripheral and user management. | CS06-02 What an operating system does Coming soon |
| 3.2.2 | Explain the purpose and functionality of utility software: file repair, backup, data compression, disk defragmentation and anti-malware. | CS06-03 Utility software Coming soon |
| 3.2.3 | Explain the importance of developing robust software and the methods of identifying vulnerabilities, including audit trails and code reviews. | CS06-04 Robust software and finding vulnerabilities Coming soon |
| 3.3.1 | Explain the characteristics and purposes of low-level and high-level programming languages. | CS06-05 High-level and low-level languages Coming soon |
| 3.3.2 | Explain how an interpreter differs from a compiler in the way it translates high-level code into machine code. | CS06-07 Compilers, interpreters and assemblers Coming soon |
| 4.1.1 | Explain why computers are connected in a network. | CS07-01 What a network is, and why bother Coming soon |
| 4.1.2 | Describe LANs and WANs. | CS07-02 LAN, WAN and PAN Coming soon |
| 4.1.3 | Explain how the internet is structured, in terms of IP addressing and routers. | CS07-08 The Internet, DNS and hosting Coming soon |
| 4.1.3x-packet | Describe the structure of a data packet - header, the data being sent, and footer - and say what the header carries. | CS08-02 The four-layer TCP/IP model Coming soon |
| 4.1.4 | Explain how the characteristics of wired and wireless connectivity affect performance in terms of speed, range, latency and bandwidth. | CS07-04 What makes a network fast Coming soon |
| 4.1.5 | Use bits per second (kilobit, megabit, gigabit) and construct expressions involving file size, transmission rate and time. | CS08-06 Transmission rate, file size and time Coming soon |
| 4.1.6 | Explain the role of and need for network protocols (Ethernet, Wi-Fi, TCP/IP, HTTP, HTTPS, FTP) and email protocols (POP3, SMTP, IMAP). | CS08-01 What a protocol is Coming soon |
| 4.1.7 | Explain how the 4-layer TCP/IP model (application, transport, internet, link) handles data transmission over a network. | CS08-02 The four-layer TCP/IP model Coming soon |
| 4.1.8 | Describe the characteristics of bus, star and mesh network topologies. | CS07-05 Network topologies Coming soon |
| 4.2.1 | Network security | CS09-06 Penetration testing Coming soonCS09-07 Protecting systems, networks and data Coming soon |
| 5.1.1 | Explain the environmental issues associated with digital devices: energy consumption, manufacture, replacement cycle and disposal. | CS17-02 The environmental cost of computing Coming soon |
| 5.2.1 | Explain the ethical and legal issues in collecting and using personal data: privacy, ownership, consent, misuse and data protection. | CS17-03 Personal data, privacy and consent Coming soon |
| 5.2.2 | Explain the ethical and legal issues raised by artificial intelligence, machine learning and robotics: accountability, safety, algorithmic bias and legal liability. | CS17-04 AI, machine learning and algorithmic bias Coming soon |
| 5.2.3 | Explain methods of intellectual property protection for computer systems and software: copyright, patents, trademarks and licensing. | CS17-06 Intellectual property Coming soon |
| 5.3.1 | Cybersecurity | CS09-02 Malware Coming soonCS09-03 Social engineering Coming soon |
| 5.3.2 | Explain methods of protecting digital systems and data: anti-malware, encryption, acceptable use policies, and backup and recovery procedures. | CS09-07 Protecting systems, networks and data Coming soon |
| 6.1.1 | Use decomposition and abstraction to analyse, understand and solve problems in code. | CS10-02 Decomposition and abstraction Coming soon |
| 6.1.2 | Read, write, analyse and refine programs written in a high-level programming language. | CS14-01 Reading and refining someone else's program Coming soon |
| 6.1.3 | Convert an algorithm given as a flowchart or pseudocode into a working program. | CS14-02 From algorithm to working program Coming soon |
| 6.1.4 | Use layout, indentation, comments, meaningful identifiers and white space to make programs easier to read, understand and maintain. | CS14-04 Code other people can read Coming soon |
| 6.1.5 | Identify, locate and correct logic, syntax and runtime errors in a program. | CS14-07 Syntax, logic and runtime errors Coming soon |
| 6.1.6 | Use logical reasoning and test data to evaluate a program's fitness for purpose and efficiency, counting compares, counting passes through a loop, and considering memory use. | CS10-08 Which algorithm is more efficient? Coming soon |
| 6.2.1 | Identify the structural components of a program: constants, variables, initialisation and assignment statements, command sequences, selection, repetition, iteration, data structures, subprograms, parameters and input/output. | CS14-03 Spotting the parts of a program Coming soon |
| 6.2.2 | Write programs using sequencing, selection, repetition and iteration, with single entry and exit points from code blocks and subprograms. | CS10-06 Sequence, selection and iteration in an algorithm Coming soon |
| 6.3.1 | Write programs using primitive data types (integer, real, Boolean, char) and one- and two-dimensional structured types (string, array, record). | CS12-02 Data types Coming soon |
| 6.3.2 | Write programs that make appropriate use of variables and constants. | CS12-01 Variables, constants and assignment Coming soonCS12-08 Putting the statement types together Coming soon |
| 6.3.3 | Write programs that manipulate strings: length, position, substrings and case conversion. | CS13-03 Working with strings Coming soon |
| 6.4.1 | Write programs that accept and respond appropriately to user input. | CS12-09 Input and output Coming soon |
| 6.4.2 | Write programs that read from and write to comma separated value text files. | CS13-04 Reading and writing files Coming soon |
| 6.4.3 | Write programs implementing validation: length check, presence check, range check and pattern check. | CS14-05 Input validation Coming soon |
| 6.4.4 | Write programs implementing authentication by ID and password, and by lookup. | CS14-06 Authentication Coming soon |
| 6.5.1 | Write programs using arithmetic operators, including modulus, integer division and exponentiation. | CS12-04 Arithmetic operators, DIV and MOD Coming soon |
| 6.5.2 | Write programs using relational operators. | CS12-05 Relational operators Coming soon |
| 6.5.3 | Write programs using the logical operators AND, OR and NOT. | CS12-06 AND, OR and NOT in a condition Coming soon |
| 6.6.1 | Write programs using pre-existing (built-in, library) and user-devised subprograms. | CS13-08 Writing and calling your own subprograms Coming soon |
| 6.6.2 | Write functions that may take parameters and must return values, and procedures that may take parameters and do not return values. | CS13-07 Functions and procedures Coming soon |
| 6.6.3 | Explain the difference between global and local variables and use each appropriately in a program. | CS13-09 Local and global variables Coming soon |
| PLS-v6 | Know that Edexcel Paper 2 is set inside a published Python subset, and know where its boundary sits. | CS10-09 Which notation do you answer in? Coming soon |