Algorithms and Data Structures
Online Teaching Arrangements (due to COVID-19)
There will not be any live classroom lectures.
Videos of lectures will be available on the LEARN
page of the ADS course under "Course Materials" (bottom of the page).
and nagivate to Algorithms and Data Structures (2020-2021)/
The weekly tutorials will be done as a mix of synchronous and asynchronous tutorials
(to accommodate all types of students; time zones, weak internet connections, etc.).
Asynchronous tutorials are videos (available on LEARN) discussing the solutions of the exercises
of this week.
Synchronous tutorials are done by live online video conferencing.
Log into www.learn.ed.ac.uk and navigate to Algorithms and Data Structures (2020-2021),
Course Tools, Blackboard Collate Ultra (in the left menue).
You need to enable microphone and camera access on your browser (Chrome browser works best).
Click on the session for your tutorial group at the regular time and then "Join session".
You can also test your system at any time by joining the TestRun session (that is already active).
Solutions to the Exercises will be posted in advance (see below), since it is hard to
write much on the online whiteboard.
In 2020/21 Algorithms and Data Structures will be taught during Semester 1
by Dr. Richard Mayr.
Timetable: The ADS course starts in week 1 of semester 1 (21. Sep. 2020).
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 (50%) and a final exam (50%).
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 50% of the
course mark) later in the semester (see below).
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).
- Exercises to be discussed in
- Lecture 1:
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).
Coursework and Feedback
Two courseworks (out of 100 marks each).
Coursework 1: (formative)
- Out: 1. Oct. 2020.
- DUE Friday, 23. Oct. 2020 (4pm) (submission online on LEARN).
- FEEDBACK: 9. Nov. 2020.
Coursework 2: (summative, counts for 50 percent of course mark)
- Out: 29. Oct. 2020.
- DUE Friday, 20. Nov. 2020 (4pm) (submission online on LEARN).
- FEEDBACK: 7. Dec. 2020.
- (*) 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