Monash University Computing & Information Technology handbook 1995

Copyright © Monash University 1995
Enquiries to publishing@udev.monash.edu.au

MAT2492

Algorithms and computational complexity

P Grossman

4 points * 2 hours of classes per week * Second semester * Caulfield * Prohibitions: MAT2521

Estimating the time complexity of algorithms, order of magnitude, polynomial and exponential algorithms, complexity of searching and sorting algorithms.

Assessment

Assignments: 40% * Examinations (2 hours): 60%

Recommended texts

Albertson M O and Hutchinson J P Discrete mathematics with algorithms Wiley, 1988


Return to subject list Return to computing handbook contents Return to the list of Monash handbooks