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: Modern Computer ArithmeticModern Computer Arithmetic
by - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(8567 views)
Book cover: A Practical Introduction to Data Structures and Algorithm AnalysisA Practical Introduction to Data Structures and Algorithm Analysis
by - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(7475 views)
Book cover: Algorithms for Clustering DataAlgorithms for Clustering Data
by - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
(12589 views)
Book cover: Fundamental Data StructuresFundamental Data Structures
- Wikipedia
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Contents of the book: Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching.
(12978 views)