Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

A Level Computer Science 10-Minute Tests

Structure and Function of the Processor, Types of Software and Development Methodologies, Exchanging Data: Databases, Networks and Web Technologies and 14 more

Level
A Level · AQA 7517 · OCR H446
Series
A Level Computer Science 10-Minute Tests
Suitable for
Years 12-13, AQA / OCR
FreePDF download · 2027 edition · 56 A4 pages
  • One file, prints straight to A4
  • No account, no password

Workbooks like this one, with 17 topics, 18 questions and mark schemes at the back, are usually printed and sold by publishers. This one is one of 558 free PDFs on the shelf.

Pages
56 A4 pages
Chapters
17 worksheet chapters
Questions
18
Answers
From page 40
Working time
About 2h 50m

What is inside

17 chapters · answers from p40

Each chapter starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 17 chapters are at the back, so the book works for homework, a timed test or revision.

  1. 01Structure and Function of the Processor1 questions · about 10 min Topic guide: Structure and Function of the Processorp3
  2. 02Types of Software and Development Methodologies1 questions · about 10 min Topic guide: Types of Software and Development Methodologiesp5
  3. 03Exchanging Data: Databases, Networks and Web Technologies1 questions · about 10 min Topic guide: Exchanging Data: Databases, Networks and Web Technologiesp7
  4. 04Data Types, Data Structures and Boolean Algebra1 questions · about 10 min Topic guide: Data Types, Data Structures and Boolean Algebrap9
  5. 05Legal, Moral, Cultural and Ethical Issues1 questions · about 10 min Topic guide: Legal, Moral, Cultural and Ethical Issuesp11
  6. 06Computer Architecture, Assembly and the LMC1 questions · about 10 min Topic guide: Computer Architecture, Assembly and the LMCp13
  7. 07Boolean Algebra, Logic Gates and Karnaugh Maps1 questions · about 10 min Topic guide: Boolean Algebra, Logic Gates and Karnaugh Mapsp15
  8. 08Networking and the Internet1 questions · about 10 min Topic guide: Networking and the Internetp17
  9. 09Object-Oriented Programming1 questions · about 10 min Topic guide: Object-Oriented Programmingp19
  10. 10Recursion and Advanced Algorithms1 questions · about 10 min Topic guide: Recursion and Advanced Algorithmsp21
  11. 11Elements of Computational Thinking1 questions · about 10 min Topic guide: Elements of Computational Thinkingp23
  12. 12Problem Solving and Programming1 questions · about 10 min Topic guide: Problem Solving and Programmingp25
  13. 13Algorithms: Complexity, Searching and Sorting1 questions · about 10 min Topic guide: Algorithms: Complexity, Searching and Sortingp27
  14. 14Programming Paradigms and OOP2 questions · about 10 min Topic guide: Programming Paradigms and OOPp29
  15. 15Data Structures and Their Operations1 questions · about 10 min Topic guide: Data Structures and Their Operationsp32
  16. 16Advanced Algorithms: Searching, Sorting and Path-Finding1 questions · about 10 min Topic guide: Advanced Algorithms: Searching, Sorting and Path-Findingp34
  17. 17Data Representation and Theory of Computation1 questions · about 10 min Topic guide: Data Representation and Theory of Computationp36
  18. AnswersMark schemes for every chapterp40

Each chapter is drawn from one of our worksheet packs. Follow a chapter title for the full pack on its own page, or browse every A Level Computer Science pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

A Level Computer Science 10-Minute Tests includes Structure and Function of the Processor (from page 3); Types of Software and Development Methodologies (from page 5); Exchanging Data: Databases, Networks and Web Technologies (from page 7); Data Types, Data Structures and Boolean Algebra (from page 9); Legal, Moral, Cultural and Ethical Issues (from page 11); Computer Architecture, Assembly and the LMC (from page 13); Boolean Algebra, Logic Gates and Karnaugh Maps (from page 15); Networking and the Internet (from page 17); Object-Oriented Programming (from page 19); Recursion and Advanced Algorithms (from page 21); Elements of Computational Thinking (from page 23); Problem Solving and Programming (from page 25); Algorithms: Complexity, Searching and Sorting (from page 27); Programming Paradigms and OOP (from page 29); Data Structures and Their Operations (from page 32); Advanced Algorithms: Searching, Sorting and Path-Finding (from page 34); Data Representation and Theory of Computation (from page 36).

Worked question 1 - Advanced Algorithms: Searching, Sorting and Path-Finding

Open the included worksheet

A satnav app calculates driving routes across a national road network containing millions of junctions.
(a)Discuss the relative advantages of using Dijkstra's algorithm compared with the A* algorithm for calculating a single driving route between two specific junctions in this network, and describe one situation in which Dijkstra's algorithm would still be the more appropriate choice.(8)

Answer and mark scheme

Question 1

CreditAnswer or working
1-3(a) L1 Basic, isolated points are made about Dijkstra's algorithm and/or A*, with little or no reference to time complexity, heuristics or the given scenario. The answer may simply name both algorithms with little justification, or fail to identify any valid situation where Dijkstra is preferable.
4-6(a) L2 Some relevant points are made about the efficiency of A* compared with Dijkstra, with limited or partly-accurate reference to heuristics and time complexity. Some link is made to the scale of the scenario (millions of junctions), and a situation favouring Dijkstra is attempted but may be only partially justified.
7-8(a) L3 A clear, well-justified discussion is given, correctly explaining how A*'s heuristic reduces the number of junctions explored compared with Dijkstra for a single specific route, supported by accurate technical detail (e.g. admissibility). A valid, clearly justified situation where Dijkstra remains the more appropriate choice is identified and linked to the scenario.
  • (a) Indicative content:
    • A* uses a heuristic (e.g. straight-line distance to the destination) to prioritise exploring junctions likely to lie on the route to the specific destination, so across a network of millions of junctions it can typically reach the destination while expanding far fewer vertices than Dijkstra's algorithm, which explores outward in all directions with no sense of direction towards the goal.
    • Both algorithms are guaranteed to find the shortest path provided the heuristic used by A* is admissible (never overestimates the true remaining distance); straight-line distance is always less than or equal to the true road distance, so it is a valid admissible heuristic here.
    • Dijkstra's algorithm remains the more appropriate choice when the shortest paths from a single junction to every other junction are needed at once (a single-source, all-destinations problem) - for example, precomputing journey times from a delivery depot to every possible drop-off point overnight - because A*'s heuristic advantage only helps when searching towards one specific, known destination.
    • Dijkstra may also be preferred when no reliable, cheap-to-compute heuristic is available for the scenario, since a poor heuristic could remove most or all of A*'s efficiency benefit (in the extreme case, a heuristic that is always 0 makes A* behave identically to Dijkstra).
    • A stronger answer may note the practical trade-off: A* needs a suitable heuristic (e.g. precomputed junction coordinates) available for every vertex, which adds a small implementation and data overhead that plain Dijkstra does not require.
  • (a) Answer: Best answers recommend A* for a single specific route, using an admissible heuristic such as straight-line distance to prioritise the search and expand far fewer junctions than Dijkstra, but correctly identify that Dijkstra is preferable when shortest paths to all destinations are needed simultaneously (e.g. depot-to-everywhere precomputation), since A*'s heuristic gives no benefit in that case.

Question 1 - Programming Paradigms and OOP

Open the included worksheet

A small program for a Bristol newsagent totals up the cost of a customer's magazines. It is written using OCR's Exam Reference Language conventions (assignment <-, iteration FOR ... NEXT, selection IF ... ENDIF).
PROCEDURE CalculateTotal(price, quantity)
  total <- price * quantity
  RETURN total
ENDPROCEDURE

PROCEDURE PrintReceipt(item, price, quantity)
  total <- CalculateTotal(price, quantity)
  OUTPUT item, " x ", quantity, " = GBP ", total
ENDPROCEDURE

CALL PrintReceipt("Weekly Puzzle Magazine", 2.50, 4)
(a)Identify the programming paradigm used in the code above.(1)
(b)Give two reasons for your answer to part (a), referring directly to the code.(2)
(c)State one change that would need to be made to this code for it to become object-oriented.(1)

Answer and mark scheme

Question 1

CreditAnswer or working
B1(a) procedural (programming) cao
B1(b) the code is organised as procedures (CalculateTotal, PrintReceipt) that are called in sequence/one from another (oe)
B1(b) there are no classes or objects defined; data (price, quantity, total) is passed directly as parameters rather than being bundled with methods (oe)
B1(c) define a class (e.g. Receipt or Item) that bundles the item's data (item, price, quantity) together with methods such as CalculateTotal and PrintReceipt (oe)
  • (a) Answer: Procedural programming.
  • (b) Answer: The code uses two procedures that call each other in sequence, and there are no classes or objects; data is simply passed between procedures as parameters.
  • (c) Answer: Create a class, for example Receipt, whose attributes hold item, price and quantity, and whose methods include CalculateTotal and PrintReceipt.

More A Level books

A Level Computer Science Topic Workbook 1

97 pp · 102 Qs

Structure and Function of the Processor, Types of Software and Development Methodologies, Exchanging Data: Databases, Networks and Web Technologies and 7 more