**Problem Solving with Algorithms and Data Structures Using Python**

by Brad Miller, David Ranum

**Publisher**: Franklin, Beedle & Associates 2011**ISBN/ASIN**: 1590282574**ISBN-13**: 9781590282571**Number of pages**: 438

**Description**:

This textbook is designed to serve as a text for a first course on data structures and algorithms, typically taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

Download or read it online for free here:

**Read online**

(online html)

## Similar books

**Design and Analysis of Computer Algorithms**

by

**David M. Mount**-

**University of Maryland**

The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.

(

**14401**views)

**Randomized Algorithms**

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.

(

**8163**views)

**Planning Algorithms**

by

**Steven M. LaValle**-

**Cambridge University Press**

Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.

(

**15636**views)

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**12036**views)