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.
AQA GCSE Computer Science (Paper 1)
–
Average score
0/15
Topics done
0
Questions answered
0
Day streak
Smart practice mixes questions you dropped marks on with new ones from the topics you’re weakest in. A topic counts as done once you’ve answered 10 of its questions.
Recommended next
Algorithms: representing, decomposing and tracing
Not started
Efficiency of algorithms
Not started
Linear search and binary search
Not started
Merge sort and bubble sort
Not started
Your units
Study Helper
Hints first, answers after you try
Hi! I’m your Study Helper for AQA GCSE Computer Science (Paper 1). Ask me about any topic, or start a practice round and I’ll help you with each question.