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

**Notes on Data Structures and Programming Techniques**

by

**James Aspnes**-

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

(

**2669**views)

**Design and Analysis of Algorithms**

by

**Herbert Edelsbrunner**-

**Duke University**

The main topics to be covered in this course are: Design Techniques; Searching; Prioritizing; Graph Algorithms; Topological Algorithms; Geometric Algorithms; NP-completeness. The emphasis will be on algorithm design and on algorithm analysis.

(

**13157**views)

**Greedy Algorithms**

by

**Witold Bednorz**-

**InTech**

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by authors. Usually some elementary knowledge is assumed.

(

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

(

**11839**views)