Computer Science

For upper-level undergraduate and graduate courses in algorithms.

Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The text includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms.

• Numerous algorithm traces throughout the book.

  • Enables students to check their understanding of the algorithm.

• Over 1,000 end-of-section exercises—With answers to 1/3 of them in the back of the book.

  • Helps students practice solving problems.

• More applications than other algorithms texts.

  • Provides students with applications to computer science to motivate the material.

• 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.

  • Provides students with expanded explanations of particular topics and additional information on algorithms.

• Upper bounds for worst-case times proven sharp.

  • Provides students with proved sharp bounds.

• Lower bounds integrated into sections that discuss problems—e.g. after presentation of several sorting algorithms, text discusses lower bound for comparison-based sorting.

  • Provides students with easy to follow organization.

• Methods used to solve NP-complete problems—Including approximation, brute force, parameterized complexity, and heuristics.

  • Provides students with comprehensive chapter on topics with significant importance in algorithms.

• Recent results—Such as Pearson's polynomial-time algorithm for the coin-changing problem and parameterized complexity.

  • Provides students with up-to-date presentation that helps motivate the material.

• Figures and tables illustrate concepts—Figure captions provide additional explanations and insight.

  • Shows students how algorithms work to elucidate proofs.

 1. Mathematical Prerequisites.


 2. Data Structures.


 3. Searching Techniques.


 4. Divide-and-Conquer.


 5. Sorting and Selection.


 6. Greedy Algorithms.


 7. Dynamic Programming.


 8. Text Searching.


 9. Computational Algebra.


10. P and NP.


11. Coping with NP-Completeness.


12. Parallel Algorithms.


References.


Solutions to Selected Exercises.


Index.

Algorithms  (Computer Science)

Richard Johnsonbaugh is Professor Emeritus of Computer Science at DePaul University. He has degrees in computer science and mathematics from the University of Oregon, Yale University, and the University of Illinois at Chicago. He is the author of numerous articles and books, including Discrete Mathematics, Fifth Edition, and, with co-author Martin Kalin, Object-Oriented Programming in C++, Second Edition, Applications Programming in C++, and Applications Programming in ANSI C, Third Edition.

Marcus Schaefer is Assistant Professor of Computer Science at DePaul University. He holds degrees in computer science and mathematics from the University of Chicago and the Universitat Karlsruhe. He has authored and co-authored several articles on complexity theory, computability, and graph theory.

Algorithms is written for an introductory upper-level undergraduate or graduate course in algorithms. With/their many years of experience in teaching algorithms courses, Richard Johnsonbaugh and Marcus Schaefer include applications of algorithms, examples, end-of-section exercises, end-of-chapter exercises, solutions to selected exercises, and notes to help the reader understand and master algorithms.

Key Features

• Links theory to real-world applications such as data compression, region-finding in digital pictures, cellular phone networks, and the implementation of agrep.
• Includes five chapters that emphasize design techniques: searching (including backtracking), divide and conquer, sorting, selection, the greedy method, and dynamic programming.
• Covers distributed algorithms—a topic recommended by the ACM (2001 report) for an undergraduate curriculum.
• Features a collection of techniques, including approximation, parameterization (a recent area of research), and use of heuristics, to deal with NP-complete problems.
• Contains more than 1450 carefully developed and classroom-tested exercises, from routine to challenging. About one-third of the end-of-section exercises include solutions.
• Provides a robust Companion Website that supplements the text by providing algorithm simulation software, PowerPoint^® slides, late breaking news about algorithms, references about the book's topics, computer programs, and more.
• Includes more than 300 worked examples, which provide motivation, clarify concepts, and show how to develop algorithms, demonstrate applications of the theory, and elucidate proofs.

Companion Website - Johnsonbaugh
Johnsonbaugh
©2003 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130932981 | ISBN-13: 9780130932983
URL:  http://www.prenhall.com/johnsonbaugh

Companion Website - Johnsonbaugh
Johnsonbaugh
©2003 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130932981 | ISBN-13: 9780130932983
URL:  http://www.prenhall.com/johnsonbaugh

Instructor's Manual
Johnsonbaugh
©2003 | Prentice Hall | Paper; 154 pp | Instock
ISBN-10: 0130932965 | ISBN-13: 9780130932969

Companion Website - Johnsonbaugh
Johnsonbaugh
©2003 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130932981 | ISBN-13: 9780130932983
URL:  http://www.prenhall.com/johnsonbaugh

Interwrite Personal Response System
EduCue, Addison-Wesley & Benjamin Cummings
©2004 | Prentice Hall | Electronic Supplement | Instock
ISBN-10: 0321267354 | ISBN-13: 9780321267351

Companion Website - Johnsonbaugh
Johnsonbaugh
©2003 | Prentice Hall | On-line Supplement | Instock
ISBN-10: 0130932981 | ISBN-13: 9780130932983
URL:  http://www.prenhall.com/johnsonbaugh

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.