Community resourceWorksheet

OCR H446 2.2.2 Computational Methods exam transition

Part 14 of 14 · H446 2.2.2 · Computational methods

This is an assessment rather than a teaching worksheet: it covers the whole of H446 2.2.2 under examination conditions, with feedback held until after submission and no prompting about which method applies. Sixty marks run from a one-mark identification to a twelve-mark evaluation, taking in a trace table and a coded task on the way.

Students will:

  • select the computational method a described problem calls for, unprompted
  • complete a trace table for an unseen backtracking search
  • construct a working coded solution under assessment conditions
  • apply each explanation to the scenario rather than writing a generic definition
  • reach a supported judgement in an extended evaluation of a proposal

Inside: 2 explanation cells, 1 multiple-choice question, 8 written answers, 1 Python task and 1 trace table. 60 marks, about 65 to 75 minutes.

Series: H446 2.2.2 · Computational methods, part 14 of 14.

Shared by Coding PathwayVerified teacher

  • 13 cells
  • About 75 minutes
  • CC BY-SA 4.0
  • Shared 31 Aug 2026
  • Updated 3 Sept 2026

Preview

The whole resource, exactly as a class sees it. Answers and marking are held back.

Computational Methods: exam transition

Complete this assessment independently and without checking answers as you go. Feedback is held until after submission. Show intermediate state, use the supplied conventions and apply every explanation to the scenario.

Use precise terminology, apply every extended point to the scenario and show your reasoning.

Written answer4 marks
  1. A careers service says, ‘Automatically recommend the best next step for every student.’ Explain two changes needed to make a useful part of this problem computationally solvable. [4]

Consider represented data, unambiguous rules and testable outputs.

Students type their answer here.

Multiple choice1 mark
  1. A search reverses its latest course choice after reaching a location with no valid onward route. Identify the computational method. [1]
  • APerformance modelling
  • BData mining
  • CBacktracking
  • DSoftware pipelining
Written answer9 marks
  1. A museum is developing a system for timed entry, accessible routes, group limits, guide allocation and visitor notifications. Discuss how problem recognition, decomposition and abstraction could be used during development. [9]

Plan before writing. Apply inputs/outputs, subproblems, interfaces and relevant/suppressed details to the museum.

Students type their answer here.

Written answer4 marks

3(b). A mapping service divides a very large image into tiles, applies the same correction to each tile, then joins the corrected tiles. Explain two features that make this divide and conquer, and why simultaneous processing could help. [4]

Refer to smaller instances, combination and available processing resources.

Students type their answer here.

Trace table38 marks
  1. Complete the trace table for this backtracking search. [marks derived from trace]

Complete the trace without checking intermediate answers.

Use one row for each statement as it runs. Fill in a box only when that value changes on that row, and leave the rest blank.

ProgramPython
  1. def make_total(total, next_value):
  2. if total == 7:
  3. return True
  4. if total > 7 or next_value > 4:
  5. return False
  6. if make_total(total + next_value, next_value + 1):
  7. return True
  8. return make_total(total, next_value + 1)
  9. found = make_total(0, 1)
  10. print(found)
Trace table with 9 columns
Rowtotal (make_total)next_value (make_total)foundReturn valueDepthtotal == 7total > 7 or next_value > 4make_total(total + next_value, next_value + 1)Output
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
Starter code8 marks
def can_fill(slots, target):
    # Write a backtracking function. Each positive slot value may be used once.
    # Return True if some combination totals target; otherwise return False.
    pass
Written answer6 marks
  1. A regional health campaign stores millions of anonymised appointment, attendance, location and reminder records. Explain how data mining could be used and evaluate one limitation of the resulting findings. [6]

Distinguish collecting the records from mining them. Link discovery to action and consequence.

Students type their answer here.

Written answer5 marks
  1. A route planner uses estimated remaining travel time to decide which partial route to explore next. Explain the role of the heuristic and one trade-off in using it. [5]

Explain selection/order, not just the dictionary definition.

Students type their answer here.

Written answer5 marks
  1. A booking site is modelled at 200, 1000 and 3000 concurrent users before launch. Explain why the developers should test increasing loads and state two useful measurements. [5]

Distinguish performance modelling from general bug testing.

Students type their answer here.

Written answer6 marks
  1. An analysis service validates data, anonymises it, calculates statistics and creates a report. Explain how software pipelining and visualisation could each help the developers. [6]

Treat them as distinct methods and apply each to the named stages.

Students type their answer here.

Written answer12 marks
  1. A council proposes mining several years of transport data and using a heuristic to prioritise service changes. Evaluate this proposal. [12]

Write a coherent extended response considering discovery value, data quality, heuristic guidance, scale, risks, validation and judgement.

Students type their answer here.

Hand-in checklist

  • I answered the command word: identify, explain, discuss or evaluate.
  • I used scenario nouns rather than writing only generic definitions.
  • My developed points contain a mechanism and consequence.
  • My code has success, failure, progress and alternative routes.
  • My extended answers include a supported, conditional judgement.

Hand in when you have checked every response.