Notes on Data Structures and Programming Techniques
by James Aspnes
Publisher: Yale University 2015
Number of pages: 530
Description:
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.
Download or read it online for free here:
Download link
(1.8MB, PDF)
Similar books
![Book cover: Randomized Algorithms](images/6716.jpg)
by Wolfgang Merkle - ESSLLI
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.
(11745 views)
![Book cover: Open Data Structures: An Introduction](images/9422.jpg)
by Pat Morin - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(15699 views)
![Book cover: Algorithms and Complexity](images/22.jpg)
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.
(21411 views)
![Book cover: Modern Computer Arithmetic](images/3688.jpg)
by Richard P. Brent, Paul Zimmermann - 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.
(15514 views)