Computer Science


Advanced Design and Analysis of Algorithms: COMPSCI 720 Semester 1, City Campus


This course is aimed at graduate level students as preparation for research work in algorithms development. It is also useful for students intending to work in the general area of theoretical computer science, and to mathematics students interested in computational combinatorics.

See the advertised CS720 showcase.

Content

Course content varies substantially each year. Please contact the course coordinator/director (Mark Wilson) if you have questions. The course has been taught by Michael Dinneen and Mark Wilson for many years.

In 2018 the course will be in two parts.

The first part, taught by Michael, will initially cover basic combinatorial algorithms (how to enumerate objects and rank/hash them). We then study fixed-parameter tractable (FPT) techniques for coping with NP-hard problems such as linear-time dynamic programs for graphs of bounded treewidth. Finally we cover some advanced algorithm topics on approximation and local search.

The second part will be taught by Mark Wilson.

Assessment

Assignments (written/programming): 40%

Final exam: 60%

Top


Apply now!


Handbook

Postgraduate study options

Computer Science Blog



Please give us your feedback or ask us a question

This message is...


My feedback or question is...


My email address is...

(Only if you need a reply)

A to Z Directory | Site map | Accessibility | Copyright | Privacy | Disclaimer | Feedback on this page