2025 16(a)Python 3
00:00
50 marks35 minutesChallenge

Results analysis

Complete the official results-processing program, then find the longest increasing run.

Task

  1. Round the mean to two decimal places and divide by the list length rather than a fixed value.
  2. Complete get_grade for Distinction (80+), Upper Merit (65+), Lower Merit (50+), Pass (40+) and Unsuccessful.
  3. Display the grade, lowest score, highest score, count below 40 and count from 50 to 79 inclusive.
  4. Find and display the longest run of consecutive increases. For the supplied data it is [51, 62, 64, 81].

Marks available

Rounds the mean to two decimal places5
Uses the list length as the divisor5
Completes all grade boundaries5
Calls get_grade and displays Lower Merit5
Finds and displays the lowest and highest scores5
Counts both requested score ranges10
Finds the complete longest increasing run15

Question wording is adapted for browser practice. The marking rubric follows the published scheme.

Official SEC 2025 Section C paper
solution.py⌘ Enter to run · ⇧ ⌘ Enter to mark
Run your code to see its output here.