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: Algorithms and ComplexityAlgorithms and Complexity
by - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
(22735 views)
Book cover: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(16139 views)
Book cover: AlgorithmsAlgorithms
by - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.
(18665 views)
Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(12926 views)