Algorithms

by Johnsonbaugh

Description for upper-level undergraduate and graduate courses inalgorithms. Filling the void left by other algorithms books,algorithms and data structures provides an approach that emphasizesdesign techniques. The text includes application of algorithms,examples, end-of-section exercises, end-of-chapter exercises, hintsand solutions to selected exercises, figures and notes to help thereader master the design and analysis of algorithms. For sale in indiansubcontinent only numerous algorithm traces throughout the book. Over 1,000 end-of-section exercises ?with answers to 1/3 of them in the back of the book. More applications than other algorithms texts. Elaborate world wide web site ?with up-to-date support for book. An icon occurs throughout the book to indicate more explanations and examples available on the web. Upper bounds for worst-case times proven sharp. Lower bounds integrated into sections that discuss problems ?e.g. After presentation of several sorting algorithms, text discusses lower bound for comparison-based sorting. Methods used to solve np-complete problems ?including approximation, brute force, parameterized complexity, and heuristics. Recent results ?such as pearson&'s polynomial-time algorithm for the coin-changing problem and parameterized complexity. Figures and tables illustrate concepts ?figure captions provide additional explanations and insight. Mathematical prerequisites. Data structures. Searching techniques. Divide-and-conquer. Sorting and selection. Greedy algorithms. Dynamic programming. Text searching. Computational algebra. P and np. Coping with np-completeness. Parallel algorithms.

Genres: Computer Science

766 pages, Paperback

First published July 31, 2003