This unit continues the study of algorithms for the solution of practical problems, and of the data structures used in their implementation. The topics covered will include the following: dynamic programming, divide and conquer, exhaustive search, graph algorithms, and the basics of numerical computing. As well as studying implementations, the mathematical tools used to analyse the resource usage of algorithms will be considered.
Two points of B-level COMP or INFS units including COMP2031 and COMP2033, and one point of B-level mathematics or mathematical statistics units.
COMP3064 is a 4 credit point first semester unit. The lecturer is Dr Weifa Liang (room 217, phone 6249 3019).
The course consists of twenty lectures, four tutorials/labs (two hours each). The times for the tutorials and labs are irregular and will be posted here when available.
Lectures are scheduled at 10am on Wednesdays (Phys G08) and 9am on Thursdays (Chem T1).
The following text book will be used for this course:
There will be three assignments and a final exam. The overall assessment will be based on a 50:50 weighting for the assignments (A/100) and the examination (E/100), respectively. It will be calculated using 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 1, this preferred scheme will be the one used.
The department's policy on plagiarism will be enforced.