OCR H446 · Component 01 · Computer systems
1.4.2 Data structures
Arrays, tuples, lists, records, queues, graphs, trees, binary trees, pointers, vertices, edges, and data structure comparisons.
What to revise
Practise data structures.
Start with these questions from the data structures topic pack. In the workspace, explain each idea from memory, compare your reasoning with the feedback, then revisit the concepts that need practice.
Use the pack alongside your OCR H446 computer systems revision. Your self-reported confidence helps plan the next review; it is not an exam mark or predicted grade.
- A singly linked list contains K -> M -> T. Explain how to insert R between M and T, then remove M.Apply
- A stack is initially empty. Push 12, push 7, pop, then push 9. State the popped value and the stack from bottom to top.Trace
- A table has indices 0-6 and hash h(k)=k MOD 7. Insert keys 16,23,9 in that order using linear probing. Give their indices.Apply
- What is an array?Arrays
- What does contiguous mean in an array?Arrays
- Why are arrays described as static?Arrays
RecallStride is independently produced and is not endorsed by OCR. OCR is a registered trademark of OCR. Topic content is published by its owner and has not yet had an independent academic review.