Addison-Wesley / Prentice Hall
Computer Science
Browse available resources for Computer Science:
- Select a resource
- Resources for Computer Science GOAL where virtual office hours are 24/7! Your Own TA, Just a Click Away! Deitel Resource Centers National Center for Women & Information Technology View material from Search Engines: Information Retrieval in Practice VideoNotes Andrew Tanenbaum Flame Award Recipient Custom Programs Instructor Resource Center myPearsonStore
ISBN-10: 0201743957
ISBN-13: 9780201743951
Publisher: Addison-Wesley
Copyright: 2003
Format: Cloth; 528 pp
Status: Out of Print
Suggested retail price: $106.60
This item is out of print and is no longer available for purchase.
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner. Written in a student-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required in an introductory algorithms course. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a solution manual.
- Covers both design and analysis frameworks.
- Employs an innovative and more comprehensive taxonomy of algorithm design techniques.
- Covers mathematical analysis of both nonrecursive and recursive algorithms, as well as empirical analysis and algorithm visualization.
- Discusses limitations of algorithms and ways to overcome them.
- Treats algorithms as problem-solving tools and develops algorithmic thinking by using puzzles and games.
- Contains over 600 exercises with hints for students and solutions for instructors.
- Includes material suggested by ACM Curriculum 2001.
(Each chapter ends with a “Summary”.)
Preface.
1. Introduction.
2. Fundamentals of the Analysis of Algorithm Efficiency.
3. Brute Force.
4. Divide-and-Conquer.
5. Decrease-and-Conquer.
6. Transform-and-conquer.
7. Space and Time Tradeoffs.
8. Dynamic Programming.
9. Greedy Technique.
10. Limitations of Algorithm Power.
11. Coping with the Limitations of Algorithm Power.
Epilogue.
Appendix A: Useful Formulas for the Analysis of Algorithms.
Appendix B: Short Tutorial on Recurrence Relations.
Bibliography.
Hints to Exercises.
Index.
Introduction to the Design and Analysis of Algorithms, 2/E
Levitin
© 2007 | Addison-Wesley | Cloth; 592 pages | Instock
ISBN-10: 0321358287 | ISBN-13: 9780321358288
Brief Description | Buy from myPearsonStore
Based on a
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, "Introduction to the Design and Analysis of Algorithms" presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.