Dr. Peter Borg told me that, for the exam, you are not required to know the proof that Kruskal’s algorithm (and the greedy algorithm) are correct. You are only required to know statements of theorems.
There was a question about scheduling problems that involved probability (MAT 2402, June 2003, question 2 – part b).
Dr. Borg told me that there will not be questions like that on the exam – of course there may be scheduling problems, but not with probabilities.
Advertisement
