GCSE · Edexcel
Edexcel GCSE 1CP2 Computer Science
14 lessons out now for this course, 84 planned. Teachers: see the spec coverage.
Binary and number basesCS017 of 9 out
- CS01-00Chapter intro: Binary and number bases3 min
- CS01-01Why computers use binary11 min
- CS01-02Denary to binary and back14 min
- CS01-03Why hexadecimal exists13 min
- CS01-05Binary and hexadecimal13 min
- CS01-06Binary addition13 min
- CS01-07Overflow12 min
- CS01-08Binary shifts
- CS01-09Negative numbers and two's complement
Units, characters and file sizeCS024 of 6 out
- CS02-00Chapter intro: Units, characters and file size3 min
- CS02-01Bits, bytes and the units of storage17 min
- CS02-02Character sets and ASCII14 min
- CS02-03Character codes run in order12 min
- CS02-05Working out the size of a text file
- CS02-06The limits of a fixed number of bits
Images, sound and compressionCS030 of 4 out
- CS03-01How an image is stored
- CS03-03How sound is stored
- CS03-04Working out image and sound file sizes
- CS03-05Why we compress data
Inside the computerCS043 of 3 out
Memory and storageCS050 of 2 out
- CS05-01RAM, ROM and types of memory
- CS05-04Secondary storage: magnetic, solid state and optical
Software, systems and languagesCS060 of 7 out
- CS06-02What an operating system does
- CS06-03Utility software
- CS06-04Robust software and finding vulnerabilities
- CS06-05High-level and low-level languages
- CS06-06Machine code and assembly language
- CS06-07Compilers, interpreters and assemblers
- CS06-08The IDE
NetworksCS070 of 5 out
- CS07-01What a network is, and why bother
- CS07-02LAN, WAN and PAN
- CS07-04What makes a network fast
- CS07-05Network topologies
- CS07-08The Internet, DNS and hosting
Protocols and layersCS080 of 4 out
- CS08-01What a protocol is
- CS08-02The four-layer TCP/IP model
- CS08-05Encryption across a network
- CS08-06Transmission rate, file size and time
Cyber securityCS090 of 4 out
- CS09-02Malware
- CS09-03Social engineering
- CS09-06Penetration testing
- CS09-07Protecting systems, networks and data
Algorithms and computational thinkingCS100 of 7 out
- CS10-02Decomposition and abstraction
- CS10-04Flowcharts
- CS10-05Pseudocode
- CS10-06Sequence, selection and iteration in an algorithm
- CS10-07Trace tables
- CS10-08Which algorithm is more efficient?
- CS10-09Which notation do you answer in?
Searching and sortingCS110 of 4 out
- CS11-01Linear search
- CS11-02Binary search
- CS11-04Bubble sort
- CS11-05Merge sort
Programming fundamentalsCS120 of 7 out
- CS12-01Variables, constants and assignment
- CS12-02Data types
- CS12-04Arithmetic operators, DIV and MOD
- CS12-05Relational operators
- CS12-06AND, OR and NOT in a condition
- CS12-08Putting the statement types together
- CS12-09Input and output
Data structures and subprogramsCS130 of 7 out
- CS13-01Arrays, one and two dimensional
- CS13-03Working with strings
- CS13-04Reading and writing files
- CS13-06Why subprograms exist
- CS13-07Functions and procedures
- CS13-08Writing and calling your own subprograms
- CS13-09Local and global variables
Writing robust programsCS140 of 7 out
- CS14-01Reading and refining someone else's program
- CS14-02From algorithm to working program
- CS14-03Spotting the parts of a program
- CS14-04Code other people can read
- CS14-05Input validation
- CS14-06Authentication
- CS14-07Syntax, logic and runtime errors
Boolean logicCS150 of 2 out
- CS15-01AND, OR and NOT as logic gates
- CS15-02XOR and combining gates
Impacts, ethics and the lawCS170 of 6 out
- CS17-02The environmental cost of computing
- CS17-03Personal data, privacy and consent
- CS17-04AI, machine learning and algorithmic bias
- CS17-05The law: Data Protection, Computer Misuse, Copyright
- CS17-06Intellectual property
- CS17-07Open source and proprietary licences