TopMyGrade

Home · GCSE · Computer Science · AQA · Topic questions

AQA GCSE Computer Science topic questions

Practice questions per spec point, written in board paper style with mark-scheme answers.

  1. CS1Fundamentals of algorithms5 questions →
  2. CS1.1Representing algorithms: pseudo-code, flowcharts, written descriptions; comparing algorithms for the same problem7 questions →
  3. CS1.2Efficiency of algorithms: comparing algorithms by number of steps; recognising why one algorithm is more efficient than another6 questions →
  4. CS1.3Searching algorithms: linear search and binary search; required preconditions and step-by-step traces7 questions →
  5. CS1.4Sorting algorithms: bubble sort and merge sort; tracing each pass and comparing efficiency7 questions →
  6. CS2Programming5 questions →
  7. CS2.1Data types: integer, real (float), Boolean, character, string; choosing an appropriate type for given data7 questions →
  8. CS2.10Structured programming and structured programming techniques: top-down design, modularity, abstraction, decomposition6 questions →
  9. CS2.11Robust and secure programming: validation, authentication, defensive programming, anticipating misuse and edge cases6 questions →
  10. CS2.12Classification of programming languages and translators: high-level vs low-level; assemblers, compilers and interpreters6 questions →
  11. CS2.2Programming concepts: variables, constants, assignment, sequence, selection (IF), iteration (WHILE, FOR), input/output7 questions →
  12. CS2.3Arithmetic operations: addition, subtraction, multiplication, real division, integer division (DIV), modulus (MOD), exponentiation7 questions →
  13. CS2.4Relational and Boolean operations: =, ≠, <, ≤, >, ≥; AND, OR, NOT; building compound conditions in selection and iteration7 questions →
  14. CS2.5Data structures: 1D and 2D arrays (lists), records; choosing a structure to fit a problem7 questions →
  15. CS2.6Input/output and file handling: reading from and writing to text files; reading user input and producing formatted output7 questions →
  16. CS2.7String handling: length, position, substring, concatenation, conversion to upper/lower case and to ASCII values7 questions →
  17. CS2.8Random number generation: using a built-in function to generate pseudo-random integers within a stated range6 questions →
  18. CS2.9Subroutines (procedures and functions): parameters and return values; local vs global variables; benefits of using subroutines7 questions →
  19. CS3Fundamentals of data representation5 questions →
  20. CS3.1Number bases: decimal (denary), binary and hexadecimal; counting in each base7 questions →
  21. CS3.2Converting between number bases: 8-bit unsigned binary ↔ denary; binary ↔ hexadecimal; denary ↔ hexadecimal7 questions →
  22. CS3.3Units of information: bit, nibble, byte, kilobyte, megabyte, gigabyte, terabyte using the 1024 prefix7 questions →
  23. CS3.4Binary arithmetic: addition of two 8-bit numbers; binary shifts (left/right) and their multiplicative effect; overflow7 questions →
  24. CS3.5Character encoding: ASCII (7-bit) and Unicode; representing text as a sequence of integer codes; comparing range and storage cost7 questions →
  25. CS3.6Representing images: pixels, resolution, colour depth; calculating file size = width × height × bits-per-pixel ÷ 87 questions →
  26. CS3.7Representing sound: analogue waveform sampled at a rate (Hz) and bit depth; file size = sample rate × duration × bit depth7 questions →
  27. CS3.8Data compression: lossy vs lossless; benefits, drawbacks and choosing the right compression for a use case7 questions →
  28. CS4Computer systems5 questions →
  29. CS4.1Hardware and software: how each is defined; relationship between them; embedded systems7 questions →
  30. CS4.2Boolean logic: AND, OR, NOT gates; logic circuit diagrams and truth tables; constructing simple expressions and simplification7 questions →
  31. CS4.3Software classification: system software (OS, utilities), application software; examples and main jobs of an OS7 questions →
  32. CS4.4Operating systems: functions — process management, memory management, file management, peripheral management, security and user interface7 questions →
  33. CS4.5Utility programs: encryption, defragmentation, data compression, backup; how each helps maintain a working system7 questions →
  34. CS4.6Stored program / von Neumann architecture: CPU, main memory, address & data buses; the fetch–decode–execute cycle7 questions →
  35. CS4.7CPU components and registers: ALU, control unit, registers (PC, MAR, MDR, accumulator); CPU performance — clock speed, cache, cores7 questions →
  36. CS4.8Memory: RAM vs ROM; volatile vs non-volatile; cache and virtual memory; secondary storage — magnetic, optical and solid-state7 questions →
  37. CS5Fundamentals of computer networks5 questions →
  38. CS5.1Networks and types: LAN vs WAN; client–server vs peer-to-peer; benefits and drawbacks of networking computers7 questions →
  39. CS5.2Wired and wireless connectivity: copper, fibre, Wi-Fi, Bluetooth; comparing speed, range, cost and reliability7 questions →
  40. CS5.3Network topologies: star and mesh (full and partial); diagrams and pros/cons of each7 questions →
  41. CS5.4Protocols: TCP/IP stack; HTTP, HTTPS, FTP, SMTP, IMAP, IP, TCP, UDP, Ethernet and Wi-Fi protocols7 questions →
  42. CS5.5Network security: encryption (asymmetric and symmetric), firewalls, MAC address filtering and authentication; layers of defence7 questions →
  43. CS5.6The 4-layer TCP/IP model: application, transport, network and link layers; what each layer does and example protocols7 questions →
  44. CS6Cyber security6 questions →
  45. CS6.1Cyber-security threats: malicious code, weak/default passwords, misconfigured access rights, removable media, unpatched software7 questions →
  46. CS6.2Social engineering: blagging, phishing, pharming, shoulder surfing; how the attacker exploits human behaviour7 questions →
  47. CS6.3Malicious code (malware): viruses, worms, Trojans, spyware, ransomware; how they spread and what each one does7 questions →
  48. CS6.4Detecting and preventing cyber-security threats: biometrics, password systems, CAPTCHA, email confirmation, automatic software updates7 questions →
  49. CS6.5Penetration testing: white-box (tester has knowledge) vs black-box (tester does not); purpose and limits7 questions →
  50. CS7Relational databases and Structured Query Language (SQL)5 questions →
  51. CS7.1Relational databases: tables, records, fields, primary and foreign keys, relationships; entity-relationship diagrams7 questions →
  52. CS7.2SQL — SELECT statements: SELECT … FROM … WHERE …; using AND/OR; ORDER BY; selecting columns and filtering rows7 questions →
  53. CS7.3SQL — INSERT, UPDATE, DELETE: adding new rows, changing existing rows and removing rows; effect on referential integrity7 questions →
  54. CS8Ethical, legal and environmental impacts of digital technology6 questions →
  55. CS8.1Ethical issues: AI bias, censorship, privacy intrusions, the digital divide; weighing benefits to society against harm6 questions →
  56. CS8.2Legal issues and key UK legislation: Data Protection Act 2018, Computer Misuse Act 1990, Copyright Designs and Patents Act 1988, Creative Commons6 questions →
  57. CS8.3Environmental issues: energy use of data centres, e-waste, manufacture and disposal of devices; mitigations and circular-economy ideas6 questions →
  58. CS8.4Privacy issues: tracking, profiling, biometric data, the right to be forgotten; informed consent and lawful data sharing6 questions →