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

FIT2004  Algorithms and data structures6 points, SCA Band 2, 0.125 EFTSLUndergraduate Faculty of Information TechnologyLeader: Associate Professor Bernd MeyerOffered
Clayton First semester 2008 (Day) SynopsisThis 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. Objectives
Upon successful completion of this unit, students will have:
Upon successful completion of this unit, students will be able to carefully design and/or analyse the algorithms they are using in order to verify important properties such as correctness, termination, and complexity. Upon successful completion of this unit, students will be able to:
Upon successful completion of this unit, students will be able to make a 'formal argument' that an algorithm and/or datastructure has a given property, such as correctness, termination or complexity. Assessment
Tutorials and practicals: 30% Contact hours4.5 x contact hrs/week PrerequisitesOne of CSE1303, FIT1008, FIT1015 and two of MAT1841, MAT1830, MTH1020 or MTH1030 or MTH112 ProhibitionsCSC2040, CSE2304, DGS2131, RDT2131 