OCR H446 ยท Component 01
1.4.2 Data structures
Arrays, tuples, lists, records, queues, graphs, trees, binary trees, pointers, vertices, edges, and data structure comparisons.
Topic overview
Build accurate recall, then apply it.
RecallStride combines active flashcards, quick checks, exam practice and scheduled review. Progress is based on learning evidence rather than passive completion.
- 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
Published with owner authorisation; awaiting independent academic review. RecallStride is independently produced and is not endorsed by OCR. OCR is a registered trademark of OCR.