This unit is concerned with the study of algorithms for solving practical problems efficiently, and the theoretical analysis of their behaviour. There will also be a brief introduction to complexity theory, the formal study of algorithm performance. A large variety of algorithms are candidates for study. These include, but are not limited to, the following: greedy algorithms dynamic programming, network flow algorithms, algorithms for string matching, parallel algorithms, graph algorithms and approximation algorithms.
24cp of 3000-comp including COMP3600. 24cp of 3000-comp including COMP3600.
COMP4600 is a 6 credit points second semester unit. The lecturers are Dr Weifa Liang (room 217, phone 6125 3019) and Prof Brendan McKay (room 335, phone 6125 3845.
The course consists of twenty-six one-hour lectures, together with occasional seminars.
Lectures are scheduled three lectures at most each week. The
detailed arrangement is as follows.
In each week, three lectures are run on Mondays,
Wednesdays, and Thursdays. After Aug. 4, the lectures will be given
at ROOM N329, CSIT Building.
The lectures are scheduled at
11:00am -- 12:00pm on Mondays, CSIT N329
12:00pm -- 1:00pm on Wednesdays, CSIT N329
12:00pm -- 1:00pm on Thursdays, CSIT N329
The following text book will be used for this course:
There will be 5-6 assignments and a final exam. The overall assessment will be based on the following formula:
Total = min(0.5A+0.5E,E+10,A+10)
The effect of using this formula is to reward students who work consistently. Unless you are notified to the contrary before the end of week 4 of semester 2, this preferred scheme will be the one used.
The department's policy on plagiarism will be enforced.