87. OCR A Level (H446) SLR14 - 1.4 Data structures part 1 - Linked lists
85. OCR A Level (H046-H446) SLR14 - 1.4 Arrays, records, lists & tuples
88. OCR A Level (H446) SLR14 - 1.4 Data structures part 2 - Graphs
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
105. OCR A Level (H446) SLR15 - 1.4 Half & full adders
90. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees
92. OCR A Level (H446) SLR14 - 1.4 Data structures part 1 - Linked lists (operations)
106. OCR A Level (H446) SLR15 - 1.4 D-type flip flops
95. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees (operations)
143. OCR A Level (H446) SLR24 - 2.2 Use of abstraction
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
35. OCR A Level (H446) SLR7 - 1.2 Addressing memory
91. OCR A Level (H446) SLR14 - 1.4 Data structures part 5 - Hash tables
107. OCR A Level (H046-H446) SLR16 - 1.5 Data Protection Act
93. OCR A Level (H446) SLR14 - 1.4 Data structures part 2 - Graphs (operations)
68. OCR A Level (H446) SLR12 - 1.3 PageRank algorithm
139. OCR A Level (H446) SLR24 - 2.2 Features of a problem
A level Computer Science: The d-type flip flop
80. OCR A Level (H046-H446) SLR13 - 1.4 Floating point binary part 2 - Normalisation