Unit name | Advanced Topics in Theoretical Computer Science (Teaching Unit) |
---|---|
Unit code | COMSM0068 |
Credit points | 0 |
Level of study | M/7 |
Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
Unit director | Dr. Clifford |
Open unit status | Not open |
Pre-requisites |
COMS10014 Mathematics for Computer Science A and COMS10013 Mathematics for Computer Science B or equivalent. COMS10017 Object-Oriented Programming and Algorithms I or equivalent. COMS20010 Introduction to Algorithms II. COMS30042 Advanced Algorithms. |
Co-requisites |
Assessment Unit COMSM0069 Advanced Topics in Theoretical Computer Science. |
School/department | School of Computer Science |
Faculty | Faculty of Engineering |
This topics course exposes the students to a selection of advanced topics in theoretical computer science related to “Theory A” and complexity. These may include (but are not restricted to) time, space, circuit or communication complexity, and distributed, randomised, parameterised, streaming or approximate counting algorithms.
While results and problems of recent origin may be included in the syllabus, the instructors aim to make the material accessible to all students fulfilling the prerequisites by providing complete lecture notes and including all necessary background material.
The unit is suitable for students with a firm grasp of the basic concepts in the 2nd and 3rd year algorithms courses, and likely of interest to those planning to move into industrial or academic research.
On successful completion of this unit, students will:
Teaching will be delivered through a combination of synchronous and asynchronous sessions, including lectures and self-directed exercises.
Teaching will take place over Weeks 1-7, and for students assessed by examination, consolidation and revision sessions in Weeks 11 and 12.
January timed assessment.