| Unit name | Advanced Algorithms |
|---|---|
| Unit code | COMS31900 |
| Credit points | 10 |
| Level of study | H/6 |
| Teaching block(s) |
Teaching Block 2 (weeks 13 - 24) |
| Unit director | Dr. Clifford |
| Open unit status | Not open |
| Pre-requisites | |
| Co-requisites |
none |
| School/department | Department of Computer Science |
| Faculty | Faculty of Engineering |
This unit gives an overview of recent advances in the design of algorithms and data structures. These fall into three broad categories.
First we will cover algorithms and data structures for fundamental problems surrounding storing, recovering and searching within data. For these problems we will see that nearly-optimal solutions are possible. Second are optimisation problems where sometimes only exponential-time algorithms are known. We will discuss when these problems admit exact efficient solutions, and when only approximation is possible. Third we will we will cover some emerging new areas in the field of algorithm design which address fundamental changes in the way that data is being processed on a large scale.
On successful completion of this unit the student will:
20 hours of lectures, a further 80 hours are nominally set aside for private study, etc. The course will run a drop-in session for 1hour/week.
100% final examination
Introduction to Algorithms – Cormen, Leiserson, Rivest, Stein
