Exam Practice
Course:
Topics:
AQA GCSE Computer Science (Paper 1)
Smart practice
A mixed round aimed at your weak spots
Unit 1
Unit 1
Representing algorithms
Algorithms: representing, decomposing and tracing
Efficiency of algorithms
Efficiency of algorithms
Searching algorithms
Linear search and binary search
Sorting algorithms
Merge sort and bubble sort
Unit 2
Unit 2
Data types
Data types
Programming concepts
Variables, constants, selection and iteration
Arithmetic operations in a programming language
Arithmetic operations, DIV and MOD
Relational operations in a programming language
Relational operations
Boolean operations in a programming language
Boolean operations in conditions
Data structures
Arrays and records
Input/output
Input and output
String handling operations in a programming language
String handling
Random number generation in a programming language
Random number generation
Structured programming and subroutines (procedures and functions)
Subroutines and structured programming
Robust and secure programming
Validation, authentication, testing and errors
No topics match this filter.
Study Helper
Hints first, answers after you try
Stuck on this one? Ask for a hint and I’ll point you in the right direction, without giving the answer away. Once you’ve checked your answer, I’ll show you how the marks are awarded.