Community resourceWorksheet

OCR H446 2.1 Integrated computational-thinking exam transition

Part 1 of 2 · H446 2.1 · Elements of computational thinking

The assessment for the whole of OCR H446 2.1: one city arts-trail app, and all five computational-thinking modes examined inside it, from inputs and abstraction through caching, reuse, decomposition, ordering, decisions and concurrency. Students work closed-book, with correctness held until teacher review.

Students will:

  • select and apply the right computational-thinking mode without being told which it is
  • specify inputs, outputs and missing preconditions for an unfamiliar service
  • devise an abstraction and state the limitation its omissions create
  • evaluate a cache policy and a component-reuse decision in the same system
  • decompose the system, order its sub-procedures and judge which work may overlap

Inside: 2 explanation cells, 1 multiple-choice question, 11 written answers and 1 trace table. 55 marks, about 70 to 85 minutes.

Series: H446 2.1 · Elements of computational thinking, part 1 of 2.

Shared by Coding PathwayVerified teacher

  • 15 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.

Integrated computational-thinking exam transition

Complete this assessment independently and without checking answers as you go. Correctness is held where the platform supports it.

Use the command words, supplied evidence and context carefully.

Scenario

A city arts-trail app helps visitors choose venues and routes. It stores venue capacity and accessibility data, caches route summaries, produces personalised suggestions and prepares venue photos/captions for publishing. Organisers can update closures and capacity while visitors use the app.

Written answer6 marks

Identify three input data items and two output data items for personalised venue suggestions. Qualify at least one output with a suitable digital or hard-copy format.

Name data and meaning, not devices.

Students type their answer here.

Written answer4 marks

State three preconditions or missing facts needed before a valid route suggestion can be produced. Explain how one affects the solution.

Make conditions testable or explicit assumptions.

Students type their answer here.

Written answer7 marks

Devise an abstraction for route choice. State four retained details, two suppressed details and one limitation caused by an omission or assumption.

Purpose: recommend a suitable route for this visitor.

Students type their answer here.

Written answer4 marks

Explain two benefits of abstraction when developing the arts-trail app.

Each benefit needs a mechanism and contextual consequence.

Students type their answer here.

Written answer6 marks

The app keeps every route summary for 24 hours even when organisers update closures. Evaluate this cache policy and recommend a change.

Consider reuse, response time, memory and stale data.

Students type their answer here.

Written answer5 marks

The team could reuse an existing route-formatting component rather than write it again. Explain two potential benefits and one check the team should make before adopting it.

Develop each benefit for this app. A reused component is not automatically suitable or error-free.

Students type their answer here.

Written answer8 marks

Decompose the app into four coherent solution components. For each, state one responsibility or interface value.

Avoid arbitrary code fragments.

Students type their answer here.

Written answer5 marks

Order these sub-procedures and justify one dependency: checkVenueOpen, buildRoute, readVisitorNeeds, returnSuggestion.

State where rejection could end processing early.

Students type their answer here.

Trace table1 mark

Trace the access decision and final result.

Enter a value only when it changes. Follow the listing in order.

Use one row for each pass through the loop. Fill in a box only when that value changes on that row, and leave the rest blank.

AlgorithmExam reference language
  1. venueOpen = True
  2. stepFree = False
  3. needsStepFree = True
  4. suitable = False
  5. if venueOpen == True then
  6. if needsStepFree == False OR stepFree == True then
  7. suitable = True
  8. endif
  9. endif
  10. print(suitable)
Trace table with 7 columns
RowvenueOpenstepFreeneedsStepFreesuitablevenueOpen == TrueneedsStepFree == False OR stepFree == TrueOutput
1
2
3
Written answer3 marks

Explain why suitable remains False in the trace, then write a change to the input data that would make it True.

Refer to both decision points.

Students type their answer here.

Multiple choice1 mark

Which tasks are most defensibly concurrent before publishing one venue page?

  • AResize the venue photo and draft its caption
  • BPublish the page and then create its caption
  • CUse the final page before venue data exists
  • DUpload the page before photo processing finishes
Written answer6 marks

Explain one benefit and two trade-offs of processing photos and captions concurrently, then state a condition that must be met before publishing.

Apply every point to the media workflow.

Students type their answer here.

Written answer

Which computational-thinking process should you revisit, and what evidence from this attempt supports that choice?

This reflection is not assessed.

Students type their answer here.