Skip to main content

COMP2711
Module Reading List

Algorithms and Data Structures I, 2020/21, Semester 1
Dr Natasha Shakhlevich
N.Shakhlevich@leeds.ac.uk
Tutor information is taken from the Module Catalogue

A. Levitin,
Introduction to the Design and Analysis of Algorithms
”, Addison Wesley, 2012 (or any earlier edition) 

M.T. Goodrich, R. Tamassia,
Algorithm design : foundations, analysis, and internet examples”, John Wiley & Sons, 2002

R.F. Gilberg, B.A. Forouzan,
Data structures : a pseudocode approach with C++”, Brooks/Cole, 2001  
 
 If online copy of the book cannot be made easily available, then I can specify the most important chapters for digitalisation. 

F.M. Carrano, J.J. Prichard,
Data Abstraction and Problem Solving with Java: Walls and Mirrors”, Addison Wesley, 2011

or “Data Abstraction and Problem Solving with C+ + : Walls and Mirrors”, Addison Wesley, 2007

T.H. Cormen, C.E. Leiserson, R.L.  Rivest, C. Stein,
Introduction to Algorithms”, MIT Press, 2009

A.V. Aho, J.E. Hopcroft, J.D. Ullman,
Data structures and algorithms”, Addison Wesley, 1983

This list was last updated on 03/08/2020