中文（繁體）
中文（简体）
English
S6 ICT: Data Structures – Practice Paper 1 (Foundation, 10 Questions)
S6 ICT: Data Structures – Practice Paper 1 (Foundation, 10 Questions)
Paper one drills the basics: zero based array indexing, last in first out stacks, first in first out queues, four comparisons for a fifteen item binary search and three links among four nodes, with answers and a one line note for every item.
Quick answer A[3] is 4; after push 5, 8, 2 a pop returns 2 and the top becomes 8; a queue dequeues A leaving B at the front; the largest index of five items is 4; binary search over fifteen items needs at most four comparisons; four nodes have three links; five items minus two dequeues is three; a stack is last in first out.
01 Paper details (check answers afterwards)
| Item | Detail |
|---|---|
| Questions | 10 questions |
| Suggested time | about 15 minutes |
| Difficulty mix | Foundation 4 · Intermediate 3 · Challenge 2 · Error redo 1 |
| Chapter | Chapter: S6 ICT | Data Structures: Arrays, Linked Lists, Stacks, Queues, Trees and Graphs |
| Level | Foundation |
02 Questions (10 items)
- FoundationFor the array A = [15, 8, 23, 4, 42], what is A[3]?
- FoundationA stack receives push 5, push 8 then push 2, and then one pop. What value is popped?
- FoundationAfter that single pop, what is now at the top of the stack?
- FoundationA queue receives enqueue A, enqueue B, enqueue C, then one dequeue. What is dequeued?
- IntermediateAfter that dequeue, which element is at the front of the queue?
- IntermediateWhat is the largest valid index of an array with five elements?
- IntermediateA binary search runs on fifteen sorted items. What is the maximum number of comparisons?
- ChallengeA linked list has four nodes. Walking from the head to the last node follows how many next links?
- ChallengeA queue holds five items and two dequeues are performed. How many items remain?
- Error redoError retry: a student wrote that a stack is first in first out. What is correct?
03 Answers and one-line notes
| # | Answer | One-line note |
|---|---|---|
| 1 | 4. | Indexing starts at zero, so A[3] is the fourth element, which is 4. |
| 2 | 2. | A stack is last in first out, so the most recent push, 2, leaves first. |
| 3 | 8. | With 2 removed the previous item, 8, becomes the new top. |
| 4 | A. | A queue is first in first out, so the earliest arrival leaves first. |
| 5 | B. | Once A has left, B moves to the front of the queue. |
| 6 | 4. | A five element array is indexed from 0 to 4, so A[5] is out of range. |
| 7 | 4. | Each step halves the range, 15 to 7 to 3 to 1, so four comparisons suffice. |
| 8 | 3. | Four nodes are joined by only three links, and the last node points to null. |
| 9 | 3. | Five minus two is three, because a dequeue removes only the front item. |
| 10 | A stack is last in first out. | A stack has one opening, so the newest push leaves first; first in first out describes a queue. |
04 What to do after marking
- After marking, redo only the wrong items and write down which step went wrong (formula, unit, or misread number).
- Repeat the same item two days later; move to the next paper only when both attempts are correct.
- Parents only need the answer and note columns; there is no need to explain every item.
Find a tutor freeTutor Registration →
Questions and answers are written originally by the TutorZone team and are not taken from any school, publisher or examination authority paper. Every value is checked by computer.