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: Tabu SearchTabu Search
by - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(10267 views)
Book cover: Think Data StructuresThink Data Structures
by - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(5610 views)
Book cover: Data Structures and AlgorithmsData Structures and Algorithms
by - 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.
(5092 views)
Book cover: Vector Models for Data-Parallel ComputingVector Models for Data-Parallel Computing
by - The MIT Press
Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.
(8070 views)