**Problems on Algorithms, 2nd edition**

by Ian Parberry, William Gasarch

**Publisher**: Prentice Hall 2002**ISBN/ASIN**: 0134335589**ISBN-13**: 9780134335582**Number of pages**: 268

**Description**:

This book is a collection of problems on the design, analysis, and verification of algorithms. It is for use by practicing programmers who wish to hone and expand their skills, as a supplementary text for students enrolled in an undergraduate or beginning graduate class on algorithms, and as a self-study text for graduate students who are preparing for the qualifying examination on algorithms for a Ph.D. program in Computer Science or Computer Engineering. It is intended to augment the problem sets found in any standard algorithms textbook.

Download or read it online for free here:

**Download link**

(2.4MB, PDF)

## Similar books

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

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

(

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

(

**11749**views)

**Algorithmic Mathematics**

by

**Leonard Soicher, Franco Vivaldi**

This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.

(

**12453**views)

**Data Structures and Algorithm Analysis in Java**

by

**Clifford A. Shaffer**-

**Dover Publications**

A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.

(

**6584**views)