Faculty of Information Technology
|Faculty||Faculty of Information Technology|
|Offered||Clayton First semester 2014 (Day)|
Malaysia First semester 2014 (Day)
Clayton Second semester 2014 (Day)
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:
Examination (3 hours): 70%; In-semester assessment: 30%
Minimum total expected workload equals 12 hours per week comprising:
(a.) Contact hours for on-campus students:
(b.) Additional requirements (all students):
One of FIT1008, FIT1015 or CSE1303 and 6 points of Level 1 mathematics.