Monash home  About Monash  Faculties  Campuses  Contact Monash 
Staff directory  AZ index  Site map 
(IT)

Leader: Ann Nicholson
Offered:
Not offered in 2006.
Synopsis: This unit introduces students to problem solving concepts and techniques fundamental to the science of programming. In doing this it covers problem specification, algorithmic design, analysis and implementation. Detailed topics include analysis of best, average and worstcase time and spacecomplexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and Btrees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.
Assessment: Tutorials and practicals: 30%; Examination (3 hours): 70%.
Contact Hours: One x 2 hr lecture/week, One x 1 hr tutorial/week, One x 1.5 hr lab/week
Prerequisites: FIT1008, FIT1015, MAT1841, MAT1830
Prohibitions: CSC2040, CSE2304, DGS2131, RDT2131