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: Elementary AlgorithmsElementary Algorithms
by - Github
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
(11501 views)
Book cover: AlgorithmsAlgorithms
by - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(15445 views)
Book cover: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(17395 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.
(18428 views)