A Level Computer Science worksheets
Component 1: Computer Systems
Component 1: Computer Systems worksheets- Full PackRevise this topic: Structure and Function of the Processor
More formats: Structure and Function of the Processor
- Full PackRevise this topic: Types of Software and Development Methodologies
More formats: Types of Software and Development Methodologies
- Full PackRevise this topic: Exchanging Data: Databases, Networks and Web Technologies
More formats: Exchanging Data: Databases, Networks and Web Technologies
- Full PackRevise this topic: Data Types, Data Structures and Boolean Algebra
More formats: Data Types, Data Structures and Boolean Algebra
- Full PackRevise this topic: Legal, Moral, Cultural and Ethical Issues
More formats: Legal, Moral, Cultural and Ethical Issues
- Full PackRevise this topic: Computer Architecture, Assembly and the LMC
More formats: Computer Architecture, Assembly and the LMC
- Full PackRevise this topic: Boolean Algebra, Logic Gates and Karnaugh Maps
More formats: Boolean Algebra, Logic Gates and Karnaugh Maps
- Full PackRevise this topic: Databases, SQL and Normalisation
More formats: Databases, SQL and Normalisation
- Full PackRevise this topic: Recursion and Advanced Algorithms
More formats: Recursion and Advanced Algorithms
Component 2: Algorithms and Programming
Component 2: Algorithms and Programming worksheets- Full PackRevise this topic: Elements of Computational Thinking
More formats: Elements of Computational Thinking
- Full PackRevise this topic: Problem Solving and Programming
More formats: Problem Solving and Programming
- Full PackRevise this topic: Algorithms: Complexity, Searching and Sorting
More formats: Algorithms: Complexity, Searching and Sorting
- Full PackRevise this topic: Programming Paradigms and OOP
More formats: Programming Paradigms and OOP
- Full PackRevise this topic: Data Structures and Their Operations
More formats: Data Structures and Their Operations
- Full PackRevise this topic: Advanced Algorithms: Searching, Sorting and Path-Finding
More formats: Advanced Algorithms: Searching, Sorting and Path-Finding
- Full PackRevise this topic: Data Representation and Theory of Computation
More formats: Data Representation and Theory of Computation
Free for personal and classroom use - see copyright & terms.
- worksheet packs
- 19
- question pages
- 141
- printable pages
- 228
- mark schemes
- 19
"Question pages": Pages that carry questions, not the mark scheme. "Printable pages": Every page in the PDF, questions and the mark scheme together.
About A Level Computer Science
A Level Computer Science brings together the way computers are built and the methods used to solve problems with them. Understanding a processor means following how its parts coordinate instruction processing, while computational thinking helps turn a large task into clear pieces that can be designed and checked. These ideas connect: a well described problem gives a program a clearer purpose, and knowledge of the machine helps explain what happens when that program runs. The examples below focus on processor performance and on decomposition, two ideas that can be reasoned through step by step.
For processor calculations, the average cycles per instruction model gives an estimate from two rates: the clock provides a number of cycles each second, and an instruction uses an average number of those cycles. Dividing the first quantity by the second estimates instructions per second. It is an average model, so it describes a typical rate under the stated assumption rather than the completion time of every individual instruction. For problem solving, decomposition splits a complex task into smaller sub-problems. Abstraction is different: it leaves out detail that is not needed for the current view of a problem. The worked examples show both the calculation and the distinction in context.
Processor structure and performance
A processor carries out instructions through coordinated internal operations. In this calculation, cycles per second divided by average cycles per instruction gives an estimated instruction rate. Review the processor structure and function guide alongside the processor worked pack.
Worked example. A processor has a clock speed of 2.5 GHz, and each instruction takes an average of 5 clock cycles to complete. Calculate the number of instructions the processor can execute in one second.
- Convert the clock speed to hertz: 2.5 GHz = 2.5 x 10^9 cycles per second.
- Divide the cycles per second by the number of cycles needed per instruction: 2.5 x 10^9 / 5.
- Calculate the result: 2.5 x 10^9 / 5 = 5 x 10^8.
- Final answer: the processor can execute 5 x 10^8 (500 million) instructions per second.
Answer: 5 x 10^8 instructions per second
Elements of computational thinking
Decomposition makes a complex task easier to approach by separating it into manageable sub-problems. Abstraction then sets aside a detail that does not need to be settled at the early design stage; in the example, the payment provider is left unspecified while the payment sub-problem is identified. Read the elements of computational thinking guide and its worked pack.
Worked example. A team is designing a new online cinema booking system. Use decomposition to identify three separate sub-problems the team would need to solve, and state one detail that could be abstracted away for one of your sub-problems at an early design stage.
- Break the overall system down into separate, manageable parts: (1) searching for and displaying available film showings, (2) selecting and reserving specific seats, (3) taking payment and issuing a booking confirmation.
- Check that each sub-problem can sensibly be designed and solved on its own, without needing to know the fine detail of the others yet.
- Choose one sub-problem, e.g. taking payment, and identify a detail that does not need to be decided yet, e.g. exactly which payment provider will process the card details.
- Final answer: sub-problems are (1) showing search/display, (2) seat selection, (3) payment and confirmation; for payment, the exact payment provider used can be abstracted away at this early stage.
Answer: Final answer: sub-problems are (1) showing search/display, (2) seat selection, (3) payment and confirmation; for payment, the exact payment provider used can be abstracted away at this early stage.
Keep going
A Level Computer Science practice papers
Pack Builder
Build these into a personalised pack.
Sitting an exam soon? Build a A Level Computer Science mock paper or print a ready-made one.





