Dariusz Kowalski's teaching

Module COMP523: Advanced Algorithmic Techniques

Academic year 2018/19, semester 1

This graduate course introduces students to fundamental algorithmic primitives. Specific topics include: models of sequential and concurrent computation, paradigms of design of algorithms, data structures, reasoning about algorithms, and analysis of complexity of algorithms. Students are exposed to technical literature in the area of discrete algorithms and learn how to search for information about new research problems.

Recent announcements:

FIRST ASSIGNMENT: submit by October 24, 2018, 16:00; see details below

General Informations:

Lecturer: Darek Kowalski
Contact hours: 30 lectures, 10 tutorials
Lectures:
Monday 12:00 - 13:00 (room ELEC 204)

Tuesday 12:00 - 14:00 (seminar room 1.01 ASHTON)
Tutorials:
Wednesday 12:00 - 13:00 (room JSM(bldg 232) SR7)
Office hours: typically on Monday 13:00 - 15:00 and Tuesday 14:00 - 15:00 (room 3.11 in Ashton Building)
If you wish to see me, also in other time, please send me an email first to make an appointment.
Recomended textbook:
J. Kleinberg, E. Tardos. Algorithm Design. Addison-Wesley, 2005

Auxiliary textbooks:

H. Attiya, J. Welch. Distributed Computing. John Wiley and Sons, Inc., 2004 (distributed algorithms)

R. Johnsonbaugh, M. Schaefer. Algorithms. Prentice Hall, 2003 (parallel algorithms)

Additional general textbooks:

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. Introduction to algorithms. Cambridge, MA, MIT Press, 2001, 2009

Michael T. Goodrich, Roberto Tamassia. Algorithm design : foundations, analysis, and Internet examples. New York, Wiley, 2002

Steven S. Skiena. The Algorithm Design Manual. Springer-Verlag London, 2008 [also available as electronic book]
Textbook on discrete mathematics:
Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren. Concrete Mathematics. Addison-Wesley Publishing Company, 1989, 1994
Pre-requisites: A first degree in Computer Science or a closely related subject (e.g.information systems or information technology), or have succesfully completed the first three years of an MEng programme in Computer Science.
Assessment weightings: 25% continuous assessment, 75% examination
Detail description of the module can be find here

Coursework:

First Assignment (Deadline: 24 October 2018, 16:00)

Lecture slides:

Tutorials (departmental access only): Tutorial 1, Tutorial 2, Tutorial 3, Tutorial 4, Tutorial 5, Tutorial 6, Tutorial 7, Tutorial 8, Tutorial 9.

Exams and assessment tasks from the previous years (2005-06, 2006-07 and 2007-08, internal access only):

Exams: 2005-06, 2006-07, 2007-08 (January), 2007-08 (August)
with solutions: 2005-06, 2006-07, 2007-08 (January), 2007-08 (August)
Mock exam 2007-08

Last updated: 10/10/2018