The diagram shows an Abstract Data Type (ADT) representation of a linked list after data items have been added. • PS is the start pointer. • PF is the free list pointer. • Labels Df, Dc, Db and Dy represent the data items of nodes in the list. • Labels Fg, Fh, Fm and Fw represent the data items of nodes in the free list. • The symbol Ø represents a null pointer. [Figure X.X]

1. (a)Describe the linked list immediately after initialisation, before any data items are added.[3]
2. (b)A program will be written to include a linked list to store alphanumeric user IDs. The design uses two variables and two 1D arrays to implement the linked list. Each array element contains data of a single data type and not a record. The statements below describe the design. Complete the statements. The two variables will be of type The two variables will be used as The values stored in the two variables will indicate The first 1D array will be of type The first 1D array will be used to The second 1D array will be of type The second 1D array will be used to to the arrays.[5]

This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.