Algorithms and data structures
4 points * Two 1-hour lectures per week and one 3-hour laboratory per fortnight * First semester * Clayton * Prerequisites: CSC1030 and 12 points of approved first year mathematics subjects (or equivalent) * Prohibitions: RDT2131
Objectives On completion of this subject, students will have an understanding of fundamental data structures and algorithms, the ability to analyse the time complexity of simple algorithms and the ability to employ these data structures and algorithms to solve practical programming tasks.
Synopsis This subject discusses concepts and techniques which are fundamental to the science of programming. Topics include analysis of best, average and worst case time and space complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; sorting algorithms; searching algorithms; and graph algorithms.
Assessment Examination (2 hours): 70% * Laboratory work: 30% * Compulsory laboratory class attendance
Prescribed texts
Sedgewick R Algorithms in C Addison-Wesley, 1990
| Published by Monash University, Clayton, Victoria
3168 Copyright © Monash University 1996 - All Rights Reserved - Caution Authorised by the Academic Registrar December 1996 |