ScholaFly

GCSE · AQA

AQA GCSE 8525 Computer Science

17 lessons out now for this course, 96 planned. Teachers: see the spec coverage.

Binary and number basesCS017 of 8 out
Units, characters and file sizeCS024 of 6 out
Images, sound and compressionCS030 of 7 out
  • CS03-01How an image is stored
  • CS03-02From binary to bitmap and back
  • CS03-03How sound is stored
  • CS03-04Working out image and sound file sizes
  • CS03-05Why we compress data
  • CS03-06Huffman coding
  • CS03-07Run length encoding
Inside the computerCS046 of 6 out
Memory and storageCS050 of 5 out
  • CS05-01RAM, ROM and types of memory
  • CS05-02Cache
  • CS05-04Secondary storage: magnetic, solid state and optical
  • CS05-05Choosing the right storage
  • CS05-06Cloud storage
Software, systems and languagesCS060 of 6 out
  • CS06-01System software and application software
  • CS06-02What an operating system does
  • CS06-03Utility software
  • CS06-05High-level and low-level languages
  • CS06-06Machine code and assembly language
  • CS06-07Compilers, interpreters and assemblers
NetworksCS070 of 4 out
  • CS07-01What a network is, and why bother
  • CS07-02LAN, WAN and PAN
  • CS07-03Wired and wireless
  • CS07-05Network topologies
Protocols and layersCS080 of 3 out
  • CS08-01What a protocol is
  • CS08-02The four-layer TCP/IP model
  • CS08-05Encryption across a network
Cyber securityCS090 of 7 out
  • CS09-01What cyber security is
  • CS09-02Malware
  • CS09-03Social engineering
  • CS09-05Pharming, weak passwords and removable media
  • CS09-06Penetration testing
  • CS09-07Protecting systems, networks and data
  • CS09-08Biometrics, CAPTCHA and automatic updates
Algorithms and computational thinkingCS100 of 7 out
  • CS10-01What an algorithm is
  • CS10-02Decomposition and abstraction
  • CS10-03Inputs, processing and outputs
  • CS10-04Flowcharts
  • CS10-05Pseudocode
  • CS10-08Which algorithm is more efficient?
  • CS10-09Which notation do you answer in?
Searching and sortingCS110 of 6 out
  • CS11-01Linear search
  • CS11-02Binary search
  • CS11-03Linear or binary: which and why
  • CS11-04Bubble sort
  • CS11-05Merge sort
  • CS11-07Bubble or merge: which and why
Programming fundamentalsCS120 of 8 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-07Loops: count-controlled and condition-controlled
  • CS12-08Putting the statement types together
  • CS12-09Input and output
Data structures and subprogramsCS130 of 8 out
  • CS13-01Arrays, one and two dimensional
  • CS13-02Records
  • CS13-03Working with strings
  • CS13-05Random numbers
  • CS13-06Why subprograms exist
  • CS13-07Functions and procedures
  • CS13-09Local and global variables
  • CS13-10The structured approach
Writing robust programsCS140 of 7 out
  • CS14-01Reading and refining someone else's program
  • CS14-04Code other people can read
  • CS14-05Input validation
  • CS14-06Authentication
  • CS14-07Syntax, logic and runtime errors
  • CS14-08Why we test, and when
  • CS14-09Choosing test data
Boolean logicCS150 of 4 out
  • CS15-01AND, OR and NOT as logic gates
  • CS15-02XOR and combining gates
  • CS15-03Logic circuit diagrams
  • CS15-04Boolean expressions
Databases and SQLCS160 of 3 out
  • CS16-01Databases and relational databases
  • CS16-02SELECT, FROM and WHERE
  • CS16-03Changing data: INSERT, UPDATE and DELETE
Impacts, ethics and the lawCS170 of 1 out
  • CS17-01The impacts of digital technology