Note AcademyNote Academy

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

Adapt for 2027B4.1.2 evaluate linked lists, B1.1.2 concurrency; part (f) algorithm must be written in Python/Java.

IBCS

As printed in the paper

The question as text

13. A car park has two barriers. One barrier is at the entrance, where tickets are issued, and one barrier is at the exit, where paid tickets are checked when cars leave. A display at the entrance, showing the current availability of spaces in the car park, is updated as tickets are issued and checked. The actions of issuing, paying and checking a ticket operate on the collection of objects, TICKETS, that is organized as a linked list. Each object holds the following information: Nr: ticket number (a progressive unique identifier) Date: date of issue Arrival: time of issue (in 24-hour format) PaidOn: date of payment PaidAt: time of payment (in 24-hour format).

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

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

  • 13(b)(i)[1]

  • 13(b)(ii)[1]

  • 13(c)[1]

  • 13(d)[3]

  • 13(e)[2]

  • 13(f)[5]

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