Logo

Think Data Structures by Allen B. Downey

Large book cover: Think Data Structures

Think Data Structures
by

Publisher: Green Tea Press
Number of pages: 187

Description:
This book is intended for college students in computer science and related fields. I try to alleviate the boredom by organizing the topics around an application -- web search -- that uses data structures extensively, and is an interesting and important topic in its own right. This book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercise that allows readers to apply what they have learned.

Home page url

Download or read it online for free here:
Download link
(780KB, PDF)

Similar books

Book cover: Notes on Data Structures and Programming TechniquesNotes on Data Structures and Programming Techniques
by - Yale University
Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.
(1341 views)
Book cover: Average Case Analysis of Algorithms on SequencesAverage Case Analysis of Algorithms on Sequences
by - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
(6766 views)
Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
(9152 views)
Book cover: Computational Geometry: Methods and ApplicationsComputational Geometry: Methods and Applications
by
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
(10318 views)