| 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. Sach |
| Open unit status | Not open |
| Pre-requisites | |
| Co-requisites |
none |
| School/department | Department of Computer Science |
| Faculty | Faculty of Engineering |
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.
20 hours of lectures, a further 80 hours are nominally set aside for coursework, private study, etc.
Coursework 30% and examination 70%
The coursework will test and extend knowledge of the material taught in roughly the first half of the unit. It will be a mixture of questions which test the students' understanding of the data structures and algorithms taught and also questions which ask the student to show familiarity with the latest advances in specific aspects of the material."
