Algorithms and Data Structures
In 2018/19 Algorithms and Data Structures will be taught during Semester 2
by Dr Richard Mayr.
Timetable: Lectures (not recorded) Mondays 14:10-15:00, G3 Bayes center,
and Thursdays 14:10-15:00, G.159 OC (Old College, South Bridge).
The first lecture will take place on Thursday 17. January 2019.
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 in week 3.
See for the allocation of students to groups.
Tutorial sheets and solutions can be downloaded here. (Solutions go up about a week later).
- Lecture 1 (Thu, 17. Jan.):
lec1.pdf (for viewing),
lec1-nup.pdf (for printing).
- Lectures 2 and 3:
lec2.3.pdf (for viewing),
lecture2.3-nup.pdf (for printing).
- Lecture 4
lec4.pdf (for viewing),
lecture4-nup.pdf (for printing).
- Lectures 5 and 6:
lec5.6.pdf (for viewing),
lecture5.6-nup.pdf (for printing).
Supplement on FFT (by Mary Cryan)
- Lecture 7
lecture7.pdf (for viewing),
lecture7-nup.pdf (for printing).
- Lecture 8
lecture8.pdf (for viewing),
lecture8-nup.pdf (for printing).
- Lecture 9
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 28. March: Discussion of Coursework 1 and Coursework 2. (This is the last lecture.)
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