Problems on Algorithms

This free online book provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms. With approximately 600 problems and 35 worked examples, this supplement provides a collection of practical problems on the design, analysis and verification of algorithms.

Book Description

The book focuses on the important areas of algorithm design and analysis: background material; algorithm design techniques; advanced data structures and NP-completeness; and miscellaneous problems. Algorithms are expressed in Pascal-like pseudocode supported by figures, diagrams, hints, solutions, and comments.
Too often the problem sets in standard algorithm texts are composed of small, idiosyncratic units of busy-work and irrelevant questions — forcing instructors into the time-consuming task of finding or composing additional problems. Designed to fill that gap, this supplement provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms.

Table of Contents

• Introduction
• Mathematical Induction
• Big-O and Big-[Omega]
• Recurrence Relations
• Correctness Proofs
• Algorithm Analysis
• Divide-and-Conquer
• Dynamic Programming
• Greedy Algorithms
• Exhaustive Search
• Data Structures
• NP-completeness
• Miscellaneous

Download Free PDF / Read Online