Problems on Algorithms

Problems on Algorithms

A collection of problems on the design, analysis, and verification of algorithms for use by practicing programmers who wish to hone and expand their skills.

Publication date: 31 Dec 2002

ISBN-10: n/a

ISBN-13: n/a

Paperback: n/a

Views: 44,370

Type: N/A

Publisher: n/a

License: n/a

Post time: 22 Feb 2005 10:11:14

Problems on Algorithms

Problems on Algorithms A collection of problems on the design, analysis, and verification of algorithms for use by practicing programmers who wish to hone and expand their skills.
Tag(s): Algorithms and Data Structures
Publication date: 31 Dec 2002
ISBN-10: n/a
ISBN-13: n/a
Paperback: n/a
Views: 44,370
Document Type: N/A
Publisher: n/a
License: n/a
Post time: 22 Feb 2005 10:11:14
Terms and Conditions :
Ian Parberry wrote:- No part of this work may be made available on a public forum (including, but not limited to a web page, ftp site, bulletin board, or internet news group) without the written permission of the author.
- No part of this work may be rented, leased, or offered for sale commercially in any form or by any means, either print, electronic, or otherwise, without written permission of the author.


 

Book excerpts:

The ability to devise effective and efficient algorithms in new situations is a skill that separates the master programmer from the merely adequate coder. The best way to develop that skill is to solve problems. To be effective problem solvers, master-programmers-in-training must do more than memorize a collection of standard techniques and applications -- they must in addition be able to internalize and integrate what they have learned and apply it in new circumstances.

This book is a collection of problems on the design, analysis, and verification of algorithms 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 (often called "breadth" or "comprehensive") 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.

Recognizing that a supplementary text must be cost-effective if it is to be useful, the author made two important and perhaps controversial decisions in order to keep its length within reasonable bounds. The first is to cover only what it is considered to be the most important areas of algorithm design and analysis. Although most instructors throw in a "fun" advanced topic such as amortized analysis, computational geometry, approximation algorithms, number-theoretic algorithms, randomized algorithms, or parallel algorithms, it had been chosen not to cover these areas. The second decision is not to search for the origin of the problems used. A lengthy discussion of the provenance of each problem would help make this hook more scholarly, but would not make it more attractive for its intended audience -- students and practicing programmers.

To make this book suitable for self-instruction, it is provided at the end of each chapter a small collection of hints, solutions, and comments. The solutions are necessarily few for reasons of brevity, and also to avoid hindering instructors in their selection of homework problems. Also included various preambles that summarize the background knowledge needed to solve the problems so that students who are familiar with the notation and style of their textbook and instructor can become more familiar with this book.
 




About The Author(s)


No information is available for this author.

William Gasarch

No information is available for this author.


No information is available for this author.

Ian Parberry

No information is available for this author.


Book Categories
Sponsors
Icons8, a free icon pack