FIT2004 - Algorithms and data structures

Leader: Associate Professor Bernd Meyer

Offered

Clayton First semester 2008 (Day)
Clayton Second semester 2008 (Day)
Sunway First semester 2008 (Day)

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 worst-case time- and space-complexity; introduction to numerical algorithms; recursion; advanced data structures such as heaps and B-trees; hashing; sorting algorithms; searching algorithms; graph algorithms; and numerical computing.

Assessment

Tutorials and practicals: 30%
Examination (3 hours): 70%.

Contact hours

4.5 hours per week

Prerequisites

One of CSE1303, FIT1008, FIT1015 and two of MAT1841, MAT1830, MTH1020 or MTH1030 or MTH112

Prohibitions

CSC2040, CSE2304, DGS2131, RDT2131