FIT2004 - Algorithms and data structures

Overview

This unit introduces you 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 … For more content click the Read More button below.

This unit introduces you 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.

Offerings

S1-01-CLAYTON-FLEXIBLE

S1-01-MALAYSIA-ON-CAMPUS

S2-01-CLAYTON-FLEXIBLE

S2-01-MALAYSIA-ON-CAMPUS

Requisites

Prerequisite

Contacts

Chief Examiner(s)

Dr Rafael Dowsley

Unit Coordinator(s)

Dr Lim Wern Han

Learning outcomes

On successful completion of this unit, you should be able to:

Analyse general problem solving strategies and algorithmic paradigms, and apply them to solving new problems;

Prove correctness of programs, analyse their space and time complexities;

Compare and contrast various abstract data types and use them appropriately;

Develop and implement algorithms to solve computational problems.

Teaching approach

Active learning

Assessment summary

This unit has threshold mark hurdles. You must achieve at least 45% of the available marks in the final scheduled assessment, at least 45% in total for in-semester assessments, and an overall unit mark of 50% or more to be able to pass the unit. If you do not achieve the threshold mark, you will receive a fail grade (NH) and a maximum mark of 45 for the unit.

Handbook