Skip to main content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.
Welcome to your Algorithims and Data Structures reading list! Here you will find the resources to support you throughout your module.
Essential Reading (to purchase)
The Algorithm Design Manual by This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.
The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.
Call Number: 005.1 SKI + eBook
Publication Date: 2010
Beginning Algorithms by A good understanding of algorithms, and the knowledge of when toapply them, is crucial to producing software that not only workscorrectly, but also performs efficiently. This is the only book toimpart all this essential information-from the basics ofalgorithms, data structures, and performance characteristics to thespecific algorithms used in development and programming tasks.
Packed with detailed explanations and instructive examples, thebook begins by offering you some fundamental data structures andthen goes on to explain various sorting algorithms. You'll thenlearn efficient practices for storing and searching by way ofhashing, trees, sets, and maps. The authors also share tips onoptimization techniques and ways to avoid common performancepitfalls. In the end, you'll be prepared to build the algorithmsand data structures most commonly encountered in day-to-daysoftware development.
Call Number: 005.1 + eBook
Publication Date: 2005
Introduction to Algorithms by Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
Call Number: 005.1 COR
Publication Date: 2009