units

FIT2004

Faculty of Information Technology

Undergraduate - Unit

print version

6 points, SCA Band 2, 0.125 EFTSL

Refer to the specific census and withdrawal dates for the semester(s) in which this unit is offered, or view unit timetables.

LevelUndergraduate
FacultyFaculty of Information Technology
OfferedClayton First semester 2014 (Day)
Malaysia First semester 2014 (Day)
Clayton Second semester 2014 (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.

Outcomes

At the completion of this unit, students 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.

Assessment

Examination (3 hours): 70%; In-semester assessment: 30%

Chief examiner(s)

Workload requirements

Minimum total expected workload equals 12 hours per week comprising:

(a.) Contact hours for on-campus students:

  • Two hours of lectures
  • One 3-hour laboratory/tutorial

(b.) Additional requirements (all students):

  • A minimum of 7 hours of independent study per week for lab preparation and reading.

This unit applies to the following area(s) of study

Prerequisites

One of FIT1008, FIT1015 or CSE1303 and 6 points of Level 1 mathematics.

Prohibitions

CSE2304, FIT2009

Additional information on this unit is available from the faculty at: