Note AcademyNote Academy

Computer Science · May / June 2016 · Paper 1 SL · Question 13

Adapt for 2027The array algorithms fit B2.2 and B2.3, but the old IB collection methods and pseudocode must be rewritten using Python or Java lists.

IBCS

As printed in the paper

The question as text

13. A local charity organizes a half-marathon to raise money. The rules to participate in the half-marathon are as follows: y The organizers limit the total number of participants to 450 y Participants belong to a team and each team must have at least three and at most five participants y Each participant registers for the event independently from the other members of their team, and they all declare their team name when registering y For scoring, the team’s final time is the sum of the times of its three fastest participants. Participants that do not cross the finishing line within 2 hours after the start, are assigned a default time of 1000 minutes. The winning team is the team with the smallest sum total. During registration, an array, PARTICIPANTS, with 450 positions is used to hold the abbreviated team names that are declared by each participant. Simultaneously, a collection TNAMES is generated: any new team name that is declared is added to the collection.

Read automatically from the paper; the printed page above is exact.

Show the answer and mark scheme
  • 13(a)[1]

  • 13(b)[1]

  • 13(c)(i)[3]

  • 13(c)(ii)[4]

  • 13(d)[6]

Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.