Everything that you might need to know about for your D1 exam listed in one place.
The chapter numbers referred to are from the OCR MEI version of the course textbook.
Textbook Chapter Topic 
Learning Outcomes Students should be able to: 
More details 

Chapter 1 Algorithms 
Communicate algorithms  Algorithm complexity, heuristic algorithms 
Use sorting algorithms  Selection with interchange sort algorithm, bubble sort algorithm Shuttle sort, insertion sort, quick sort algorithms 

Use search algorithms  Linear search, indexed sequential search, binary search algorithms  
Chapter 2 Graphs 
Understand the definitions associated with graph theory  List of definitions 
Chapter 3 Networks 
Solve minimum connector problems  Minimal spanning tree algorithms, Kruskal‘s and Prim‘s algorithms 
Use and create distance tables and networks  
Find a shortest path  Dijkstra‘s algorithm  
Use algorithms to find a shortest route  
Appreciate the complexities of different algorithms  Kruskal‘s, Prim‘s and Dijkstra‘s compared  
Chapter 4 Critical Path Analysis 
Draw activity networks and identify critical paths  Precedence diagrams, earliest event times, latest event times, floats 
Allocate Resources  
Chapter 5 Linear Programming 
Formulate Problems  Constraints, feasible regions 
Use integer programming  
Solve minimisation problems  Negative values  
Chapter 6 Simulations 
Use Monte Carlo methods  Random devices 
Use arrival and service times  
Simulate queuing situations  
Correct rules 