Algorithms and graph theory for computing
R Farmer
4 points * 2 hours of classes per week * First semester * Peninsula * Prerequisites: MAT1130, MAT1131 or MAT1470 * Prohibitions: MAT2472, MAT2492
Time complexity of algorithms, complexity of searching and sorting algorithms, planarity, shortest path algorithms, optimal flow in networks.
Assessment
Assignments: 40% * Examinations (2 hours): 60%
Recommended texts
Albertson M O and Hutchinson J P Discrete mathematics with algorithms Wiley, 1988
Wilson R J Introduction to graph theory 3rd edn, Longman, 1985