AQA · 8525

AQA GCSE Computer Science

40 topics and 574 questions in AQA's style.

The two papers

  • 8525/1 Computational thinking and programming skills. 90 marks, 120 minutes.
  • 8525/2 Computing concepts. 90 marks, 105 minutes.

Questions show code in AQA pseudo-code. Your own answers can be in C#, Python or VB.NET.

Practise AQA questions

Algorithms AQA Paper 1

  • 3.1.1
    Abstraction, decomposition and algorithms
    • Explain what an algorithm is and that a program implements one
    • Use abstraction and decomposition on a problem, with a structure diagram
    • Name the inputs, processes and outputs of a problem or algorithm
    LessonPractice
  • 3.1.1
    Flowcharts, pseudocode and trace tables
    • Read and draw flowcharts with the standard symbols
    • Complete a trace table for a short algorithm
    • Work out what a simple algorithm is for
    LessonPractice
  • 3.1.2, 3.1.3
    Linear and binary search
    • Run a linear search and a binary search by hand
    • State that binary search needs sorted data
    • Compare the two searches, including how many comparisons each makes
    LessonPractice
  • 3.1.2, 3.1.4
    Bubble sort and merge sort
    • Show the list after each pass of a bubble sort
    • Show how a merge sort splits and merges a list
    • Compare bubble sort and merge sort for time and memory
    LessonPractice

Programming AQA Paper 1

  • 3.1.1, 3.2
    Reading AQA pseudo-code
    • Read assignment with ←, = and ≠ as comparisons, and CONSTANT
    • Read FOR, FOR IN, WHILE, REPEAT UNTIL and IF with ELSE IF
    • Use SUBSTRING (end position included), POSITION, LEN and the conversion subroutines
    LessonPractice
  • 3.2.1, 3.2.8
    Data types and casting
    • Choose integer, real, Boolean, character or string for a piece of data
    • Convert between strings and numbers, and say when a program must
    LessonPractice
  • 3.2.2, 3.2.3, 3.2.4, 3.2.7, 3.2.9
    Variables, constants, operators and input
    • Use variables and constants, and explain why a named constant helps
    • Evaluate expressions with +, -, *, /, DIV, MOD and comparisons
    • Take input, give output and generate random numbers
    LessonPractice
  • 3.2.2, 3.2.5
    Selection and Boolean conditions
    • Trace IF, ELSE IF and nested selection
    • Combine conditions with AND, OR and NOT
    • Choose test values that reach every branch
    LessonPractice
  • 3.2.2
    Count-controlled and condition-controlled loops
    • Trace count-controlled loops, including STEP
    • Trace loops with the condition at the start or the end
    • Trace nested loops and count how often a line runs
    LessonPractice
  • 3.2.8
    String handling
    • Find a string's length, a character's position and a substring
    • Join strings and convert between characters and character codes
    LessonPractice
  • 3.2.6
    Arrays and records
    • Read and update one-dimensional and two-dimensional arrays
    • Total, search and count through an array with a loop
    • Use a record to keep related fields together
    LessonPractice
  • 3.2.10
    Procedures, functions and parameters
    • Tell a procedure from a function and trace a call
    • Pass data in with parameters and out with a return value
    • Explain local and global variables and why structured code helps
    LessonPractice
  • 3.2.11
    Validation, authentication and maintainable code
    • Write a range, length or presence check
    • Write a simple username and password check
    • Explain how naming, indentation, comments and subroutines help maintenance
    LessonPractice
  • 3.2.11
    Testing and errors
    • Choose normal, boundary and erroneous (invalid) test data
    • Tell a syntax error from a logic error and fix it
    • Complete a test plan; tell iterative from final testing
    LessonPractice

Data representation AQA Paper 2

  • 3.3.3
    Bits, bytes and storage units
    • Use bit, nibble, byte and the prefixes kilo to peta
    • Convert between units and compare quantities of data
    • Work out how much storage a set of files needs
    LessonPractice
  • 3.3.1, 3.3.2
    Binary, denary and hexadecimal
    • Convert between binary, denary and hexadecimal from 0 to 255
    • Explain why hexadecimal is used
    LessonPractice
  • 3.3.4
    Binary addition and shifts
    • Add binary numbers of up to 8 bits and spot overflow
    • Apply logical left and right shifts and say what they do to the value
    LessonPractice
  • 3.3.5
    Characters, ASCII and Unicode
    • Use a character set table and the order of its codes
    • Explain the number of characters a number of bits allows
    • Compare ASCII and Unicode
    LessonPractice
  • 3.3.6
    Bitmap images
    • Explain pixels, resolution and colour depth
    • Calculate an image's file size
    • Turn a bit pattern into a bitmap and back
    LessonPractice
  • 3.3.7
    Sound
    • Explain sampling, sample rate and bit depth (sample resolution)
    • Calculate a sound file's size and the effect of each setting
    LessonPractice
  • 3.3.8
    Why and how data is compressed
    • Explain why files are compressed
    • Compare lossy and lossless compression for a given use
    LessonPractice
  • 3.3.8
    Run length encoding and Huffman coding
    • Write data as RLE frequency and data pairs
    • Read a Huffman tree and find each character's code
    • Calculate the bits saved against 7-bit ASCII
    LessonPractice

Computer systems AQA Paper 2

  • 3.4.5
    The CPU and the fetch-execute cycle
    • Describe the ALU, control unit, clock, registers, cache and buses
    • Describe the fetch, decode and execute stages
    LessonPractice
  • 3.4.5
    CPU performance and embedded systems
    • Explain how clock speed, cores and cache size affect performance
    • Describe embedded systems and give examples
    LessonPractice
  • 3.4.5
    RAM, ROM, cache and virtual memory
    • Compare RAM and ROM, and explain volatile and non-volatile
    • Explain what cache and registers are for
    • Explain why and how virtual memory is used (OCR)
    LessonPractice
  • 3.4.5
    Secondary storage and the cloud
    • Explain why secondary storage is needed
    • Compare magnetic, solid state and optical storage on capacity, speed, portability, durability, reliability and cost
    • Compare cloud and local storage
    LessonPractice
  • 3.4.2
    Logic gates and truth tables
    • Give the truth tables for AND, OR and NOT
    • Complete truth tables for circuits of up to three inputs
    • Draw a circuit from a Boolean statement and the reverse
    LessonPractice
  • 3.4.2
    XOR and Boolean expressions
    • Use the XOR gate and its truth table
    • Write and read expressions with . + ⊕ and the overbar
    LessonPractice
  • 3.4.1, 3.4.3
    Operating systems and utility software
    • Tell hardware from software, and system from application software
    • Describe what an operating system manages
    • Explain what encryption, defragmentation and compression utilities do
    LessonPractice
  • 3.4.4
    Programming languages and translators
    • Compare high-level and low-level languages, machine code and assembly
    • Compare compilers and interpreters
    • Explain what an assembler does (AQA)
    LessonPractice

Networks and cyber security AQA Paper 2

  • 3.5
    Types of network
    • Describe LANs and WANs, and PANs (AQA)
    • Give the advantages and disadvantages of networking computers
    • Explain what affects a network's performance (OCR)
    LessonPractice
  • 3.5
    Wired and wireless connections
    • Compare wired and wireless networks and choose one for a scenario
    • Describe Ethernet, Wi-Fi and Bluetooth
    • Describe IP and MAC addresses (OCR)
    LessonPractice
  • 3.5
    Protocols and layers
    • Explain what a protocol and a standard are
    • Give the purpose of TCP, IP, HTTP, HTTPS, FTP, POP, IMAP and SMTP
    • Explain why protocols are layered; name the four TCP/IP layers (AQA)
    LessonPractice
  • 3.5
    Securing a network
    • Explain authentication, encryption, firewalls and MAC address filtering
    • Say how these methods work together
    LessonPractice
  • 3.6.1, 3.6.2
    Cyber security threats
    • Describe malware: viruses, trojans and spyware
    • Describe social engineering: phishing, blagging and shouldering
    • Describe brute-force, denial of service, interception, SQL injection and pharming
    LessonPractice
  • 3.6.2, 3.6.3
    Preventing attacks
    • Explain penetration testing, firewalls, anti-malware, access levels and passwords
    • Explain encryption, physical security, biometrics, CAPTCHA, email confirmation and automatic updates
    • Match a prevention method to a threat
    LessonPractice

Databases, ethics and law AQA Paper 2

  • 3.7.1
    Relational databases
    • Use table, record, field, data type, primary key and foreign key
    • Explain how related tables remove redundancy and inconsistency
    LessonPractice
  • 3.7.2
    SQL: finding data
    • Write SELECT ... FROM ... WHERE queries
    • Sort results with ORDER BY and join two tables (AQA)
    LessonPractice
  • 3.7.2
    SQL: inserting, updating and deleting
    • Write INSERT INTO, UPDATE ... SET and DELETE FROM statements
    LessonPractice
  • 3.8
    Ethical, legal, cultural and environmental impacts
    • Discuss the impacts of digital technology on people and the environment
    • Weigh privacy against security in a scenario
    • Write a balanced extended answer
    LessonPractice

GCSE Computer Science Pro

Full refund within 14 days, for any reason. Terms

£49

12 months of access

By paying you agree to our Terms and get access straight away, which ends your 14-day cancellation right. Your full refund within 14 days, for any reason, still applies.

No VAT is charged.