Logo

Problems on Algorithms, 2nd edition

Large book cover: Problems on Algorithms, 2nd edition

Problems on Algorithms, 2nd edition
by

Publisher: Prentice Hall
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

Book cover: Search Algorithms and ApplicationsSearch Algorithms and Applications
by - 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.
(15319 views)
Book cover: Computer Arithmetic of Geometrical Figures: Algorithms and Hardware DesignComputer Arithmetic of Geometrical Figures: Algorithms and Hardware Design
by - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
(10259 views)
Book cover: Computational Geometry: Methods and ApplicationsComputational Geometry: Methods and Applications
by
The author concentrates on four themes in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems. Solving manufacturing problems requires application of fast-algorithm techniques.
(15991 views)
Book cover: A=BA=B
by - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(26129 views)