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: Tabu SearchTabu Search
by - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(13871 views)
Book cover: Data Structures and Algorithm Analysis in JavaData Structures and Algorithm Analysis in Java
by - Dover Publications
A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.
(19663 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.
(11976 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(15886 views)