Okay guessing time. Here is what I expect to come up in the exam tomorrow.
Definitions - they love the reason for a dummy definition but I would expect definition on algorithms on networks or matchings.
Kruskal's, that is pretty certain to come up. Make sure you know the differences between Prim's and Kruskal's.
Sorting algorithm, you will either get Bubble or Quick, probably numerical descending order, which is likely to lead into...
Bin Packing - Make sure you know how to find the lower bound / proving a solution is maximal.
CPA - Maybe drawing an activity network and my money would be on a Gantt. Make sure you know how to find a lower bound from the activity network AND from a Gantt.
Linear Programming - Hammer linear programming, it is on every paper and is often the poorest answered. Unless you know how to go from context to a restriction you could be absolutely stuffed. Also make sure you know the basics, y = mx + c, if you don't know how to draw a line, do a table of values! you only need 3 points. I wouldn't be surprised if you get a decimal point but require an integer solution, so practise these.