Worksheet library · A Level
A Level Computer Science Exam Questions by Topic
Practise A Level Computer Science one topic at a time with original OCR H446, AQA, WJEC and Eduqas-style questions. The 19 topic sets below contain 267 printable pages, with the mark scheme beside the questions so you can check the method before moving on.
Browse by strand/tier
How to practise exam questions by topic
- Choose the topic that cost marks in classwork or a past paper. Try the questions without notes so the first attempt shows what the student can actually recall.
- Use the mark scheme to compare the method as well as the final answer. For written subjects, check that each credited point is stated clearly; for calculations, identify the first step that went wrong.
- Revisit the same topic after a gap, then mix it into a full paper. Topic practice repairs one weakness at a time, while a timed paper checks whether the method can still be recognised among other questions.
See the method: Structure and Function of the Processor
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.
1.1 Structure and Function of the Processor5p + answers · 90 marks · PDF
1.2 Types of Software and Development Methodologies4p + answers · 129 marks · PDF
1.3 Exchanging Data: Databases, Networks and Web Technologies5p + answers · 117 marks · PDF
1.4 Data Types, Data Structures and Boolean Algebra8p + answers · 138 marks · PDF
1.5 Legal, Moral, Cultural and Ethical Issues5p + answers · 112 marks · PDF
1.6 Computer Architecture, Assembly and the LMC5p + answers · 93 marks · PDF
1.7 Boolean Algebra, Logic Gates and Karnaugh Maps7p + answers · 85 marks · PDF
1.8 Databases, SQL and Normalisation6p + answers · 104 marks · PDF
2.7 Object-Oriented Programming7p + answers · 127 marks · PDF
2.8 Recursion and Advanced Algorithms8p + answers · 107 marks · PDF
2.1 Elements of Computational Thinking10p + answers · 133 marks · PDF
2.2 Problem Solving and Programming10p + answers · 144 marks · PDF
2.3 Algorithms: Complexity, Searching and Sorting10p + answers · 102 marks · PDF
2.4 Programming Paradigms and OOP7p + answers · 81 marks · PDF
2.5 Data Structures and Their Operations5p + answers · 114 marks · PDF
2.6 Advanced Algorithms: Searching, Sorting and Path-Finding12p + answers · 132 marks · PDF
1.9 Databases and SQL6p + answers · 104 marks · PDF
1.10 Networking and the Internet5p + answers · 120 marks · PDF
2.9 Data Representation and Theory of Computation5p + answers · 128 marks · PDF
Free for personal and classroom use - see copyright & terms. Every pack ends with its full mark scheme.
Or grab a ready-made book
Build these into a personalised pack.
Pick topics in the Pack Builder and we'll stitch them into one printable book with the student's name on the cover.