**Fundamental Data Structures**

**Publisher**: Wikipedia 2011**Number of pages**: 411

**Description**:

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: Introduction; Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

**Algorithms and Complexity**

by

**Herbert S. Wilf**-

**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.

(

**12524**views)

**Algorithms**

by

**Jeff Erickson**-

**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.

(

**10778**views)

**Algorithms and Data Structures: The Basic Toolbox**

by

**K. Mehlhorn, P. Sanders**-

**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.

(

**6802**views)

**A Practical Introduction to Data Structures and Algorithm Analysis**

by

**Clifford A. Shaffer**-

**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.

(

**7641**views)