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

**Search Algorithms and Applications**

by

**Nashat Mansour**-

**InTech**

This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.

(

**9798**views)

**Algorithms and Data Structures: With Applications to Graphics and Geometry**

by

**Jurg Nievergelt, Klaus Hinrichs**-

**Prentice Hall**

Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.

(

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

**Data Structures and Algorithms**

by

**Catherine Leung**-

**GitBook**

This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.

(

**3540**views)