FIT2004 - Algorithms and data structures - 2018

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.

At the completion of this unit, students should be able to:

1. analyse general problem solving strategies and algorithmic paradigms, and apply them to solving new problems;
2. prove correctness of programs, analyse their space and time complexities;
3. compare and contrast various abstract data types and use them appropriately;
4. develop and implement algorithms to solve computational problems.

Examination (2 hours): 60%, In-semester assessment: 40%

Minimum total expected workload equals 12 hours per week comprising:

1. Contact hours for on-campus students:
   • Two hours of lectures
   • One 3-hour laboratory/tutorial
2. Additional requirements (all students):
   • A minimum of 7 hours of independent study per week for lab preparation and reading.

See also Unit timetable information

Computer science

Computational science

http://www.infotech.monash.edu.au/units/