Monash University Science handbook 1995

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

CSC2040

Science of programming

K Marriott

4 points * Two 1-hour lectures per week and one 3-hour laboratory per fortnight * First semester * Clayton * Prerequisites: As for CSC2010 * Prohibitions: Unacceptable combination with SFT2121, RDT2301, RDT2831, BUS2011 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; program correctness; recursion; advanced data structures such as heaps and B-trees; sorting algorithms; searching algorithms; and graph algorithms.

Assessment

Examinations (2 hours): 75% * Laboratory work: 25% * Compulsory laboratory class attendance



Return to details of undergraduate subjects
Return to Science handbook contents
Return to the list of Monash handbooks