Problems on Algorithms, Second Edition

Collection of 965 problems on the design, analysis, and verification of algorithms.

**Tag(s):**
Algorithms and Data Structures

**Publication date**: 31 Dec 2002

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
n/a

**Views**: 28,241

Problems on Algorithms, Second Edition

Collection of 965 problems on the design, analysis, and verification of algorithms.

Book summary:

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.

To keep this book's length in a reasonable bounds, the author has made two decisions. The first is to cover only what it considers to be the most important areas of algorithm design and analysis. The second is not to search for the origin of the problems used. A lengthy discussion of the provenance of each problem would help make this book more scholarly, but would not make it more attractive for its intended audience - students and practicing programmers.

Reviews:

Amazon.com

:) "The ultimate purpose of this book is to assist you in understanding how to design and analyze algorithms in general via the solution of problems, not to provide you with every algorithmic technique under the sun. In that purpose I think that it succeeds brilliantly. Just remember that ultimately it is a book of problems. You should look elsewhere for the details of the theory. Highly recommended."

:) "This is a terrific little book, which I recommend highly to students of computer science, but above all to those who teach computer science."

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.

To keep this book's length in a reasonable bounds, the author has made two decisions. The first is to cover only what it considers to be the most important areas of algorithm design and analysis. The second is not to search for the origin of the problems used. A lengthy discussion of the provenance of each problem would help make this book more scholarly, but would not make it more attractive for its intended audience - students and practicing programmers.

Reviews:

Amazon.com

:) "The ultimate purpose of this book is to assist you in understanding how to design and analyze algorithms in general via the solution of problems, not to provide you with every algorithmic technique under the sun. In that purpose I think that it succeeds brilliantly. Just remember that ultimately it is a book of problems. You should look elsewhere for the details of the theory. Highly recommended."

:) "This is a terrific little book, which I recommend highly to students of computer science, but above all to those who teach computer science."

Tweet

About The Author(s)

No information is available for this author.

No information is available for this author.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors