Problems on algorithms

Author(s)

• Parberry, Ian

Bibliographic Information

Problems on algorithms

Ian Parberry

Prentice Hall, c1995

Note

Includes bibliographical references (p. 168-173) and index

Description and Table of Contents

Description

With approximately 600 problems and 35 worked examples, this supplement provides a collection of practical problems on the design, analysis and verification of algorithms. 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.

Table of Contents

*Introduction *Mathematical Induction *Big-O and Big-...W *Recurrence Relations *Correctness Proofs *Algorithm Analysis *Divide-and-Conquer *Dynamic Programming *Greedy Algorithms *Advanced Data Structures *Exhaustive Search. *NP-completeness *Miscellaneous Bibliography

by "Nielsen BookData"

Details

• NCID: BA2763813X
• ISBN:
  • 0134335589
• LCCN: 94048519
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Englewood Cliffs, N.J.
• Pages/Volumes: x, 179 p.
• Size: 24 cm
• Classification:
  • LCC : QA76.9.A43
  • DC20 : 005.1
• Subject Headings:
  • LCSH : Computer algorithms