Computer Science (AS & A Level) · Oct / Nov 2022 · Paper 32 · Question 11
9618
As printed in the paper
The question as text
A simplified linked list is used to store the names of flowers in alphabetical order. It is implemented using two 1D arrays: • Flower stores the names of the flowers. • NextPointer stores the pointer to the next flower name in the list. HeadPointer indicates the index of the first flower name in the linked list. HeadPointer 6 When the end of the linked list is reached, the next pointer has the value of 0. The following table shows the initial content of the arrays. Index Flower NextPointer 1 Rose 7 2 Marigold 1 3 Foxglove 10 4 Iris 9 5 Daisy 3 6 Dahlia 5 7 Saxifrage 0 8 Lupin 2 9 Lily 8 10 Hydrangea 4
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
11(a)[3]
11(b)[5]
11(c)[2]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.