Computer Science (AS & A Level) · Oct / Nov 2024 · Paper 42 · Question 2
9618
As printed in the paper
The question as text
A linear queue data structure is designed using a record structure. The record structure Queue has the following fields: • QueueArray, a 1D array of up to 100 integer values • Headpointer, a variable that stores the index of the first data item in QueueArray • Tailpointer, a variable that stores the index of the next free location in QueueArray.
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
2(a)[3]
2(b)[3]
2(c)[5]
2(d)[3]
2(e)(i)[5]
2(e)(ii)[2]
2(f)[4]
2(g)(i)[3]
2(g)(ii)[1]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.