Algorithms and Data Structures
In 2016/17 Algorithms and Data Structures will be taught during Semester 2
by Dr Richard Mayr.
ADS teaches material important for research in Computer Science,
and for the Database and Web Search industries.
- The DRPS entry for ADS (including syllabus, pre-requisites, etc) is
Note that ADS is now a level 10 course, therefore 4th year
undergraduates who did not previously take ADS may take it this year.
It is still primarily a 3rd year course.
- We assume the students know and are confident with
Algorithms/Data Structures to Inf 2B level, and are strong in Maths.
Students should have good grades in DMMR and Probability or an
alternative year 2 Maths programme, and should be comfortable with
here for reference)
- ADS is assessed with coursework (25%) and an exam (75%).
There will be 1 formative coursework during semester (feedback
will be returned to students, but the work will not count for
assessment), and a 1 summative coursework (contributing 25% of the
course mark) later in the semester.
Tutorials start week 3.
The allocation of students to groups is here.
Tutorial sheets and solutions (sols go up about a week later):
There are two lectures each week:
- Lecture 1 (Mon, 16 Jan):
lec1.pdf (for viewing),
lec1-4.pdf (for printing).
- Lectures 2 and 3 (Thurs, 19 Jan and Mon 23 Jan):
lec2.3.pdf (for viewing),
lecture2.3-nup.pdf (for printing).
- Lecture 4 (Thu 26. Jan.)
lec4.pdf (for viewing),
lecture4-nup.pdf (for printing).
- Lectures 5 and 6 (Mon, 30 Jan and Thu 2 Feb):
lec5.6.pdf (for viewing),
lecture5.6-nup.pdf (for printing).
Supplement on FFT (by Mary Cryan)
- Lecture 7 (Mon 6. Feb.)
lecture7.pdf (for viewing),
lecture7-nup.pdf (for printing).
- Lecture 8 (Thu 9. Feb.)
lecture8.pdf (for viewing),
lecture8-nup.pdf (for printing).
- Lecture 9 (Mon 13. Feb.)
lecture9.pdf (for viewing),
lecture9-nup.pdf (for printing).
- Lectures 10-11
lecture10.11.pdf (for viewing),
lecture10.11-nup.pdf (for printing).
- Lectures 12-13
lecture12.13.pdf (for viewing),
lecture12.13-nup.pdf (for printing).
- Lectures 14-15
lecture14.15.pdf (for viewing),
lecture14.15-nup.pdf (for printing).
- Lecture 16
lecture16.pdf (for viewing),
lecture16-nup.pdf (for printing).
- Lectures 17-18
lecture17.18.pdf (for viewing),
lecture17.18-nup.pdf (for printing).
- Thursday 30. March: Discussion of coursework.
Coursework and Feedback
Two courseworks (out of 100 marks each).
- (*) Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms
(3nd Edition). McGraw-Hill, 2002. Our course text
- Kleinberg and Tardos: Algorithm Design. Addison-Wesley, 2005.
- Gibbons: Algorithmic Graph Theory. Cambridge University
- Sedgewick: Algorithms in C (Part 1-5), Addison Wesley, 2001.
Home : Teaching : Courses
|Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail:
Please contact our webadmin with
any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright ©
The University of Edinburgh