Author: (USA) Baase
Publisher:
Publish Date: 2002-04-01
Features: The main content of this book includes three parts: first, it introduces how to use algorithms to solve real-world problems frequently encountered in computer applications; second, it introduces the basic principles and techniques of computational complexity; finally, it explains NP-completeness problems and parallel algorithms. This book emphasizes algorithm design techniques. For each problem, it first discusses multiple solution methods, then designs, analyzes, modifies, or discards an algorithm, and through continuous in-depth research, eventually achieves a satisfactory result. Therefore, the author hopes that readers will gradually develop a new way of thinking when analyzing problems by reading this book. Based on the second edition, this edition adds three new chapters and many new topics, while also rearranging the original chapters. This edition also adds more than 100 new exercises and Java examples. All programs in the book are given in Java pseudocode.
Content:
1. Principles of Algorithm Analysis
2. Data Abstraction and Basic Data Structures
3. Recursion and Induction
4. Classification
5. Selection
6. Dynamic Collections and Searching
7. Graphs and Graph Traversal
8. Graph Optimization Problems and Greedy Algorithms
9. Transitive Closure
10. Dynamic Programming
11. String Matching
12. Polynomials and Matrices
13. NP-Completeness Problems
14. Parallel Algorithms
Appendix: Java Examples and Techniques
Author Bio: Sara Baase is a professor of computer science at San Diego University and has been teaching CS for 25 years. Dr. Baase is a three-time recipient of the San State University Alumni Association's Outstanding Faculty Award and has written numerous textbooks in the areas of algorithms, assembly language, and social and ethical issues related to computing. She earned her doctorate at the University of California, Berkeley. Allen Van Celder is a professor of computer science at the University of California at Santa Cruz, where he has been teaching CS for 12 years. He received his Ph.D. in Computer Science at Stanford University and is a past recipient of the Presidential Young Investigator Award.
Computer Algorithms: An Introduction to Design and Analysis (3rd Edition. Photocopy Edition)
📌 Related Posts
Literature
Child Witness -- Animal Hospital
2026-09-13
Literature
Western perception of Eastern painting art
2026-09-24
Literature
Graphics and Advertising
2026-09-27
Literature
Fundamentals of Modern Management
2026-10-03
Literature
Test Process Improvement: A Step-by-Step Practical Guide (Reprint Edition)
2026-10-18
Literature
Application Use Cases Method: A Practical Guide (Second Edition Photocopy Edition)
2026-10-18
Literature
Modern Practical Japanese (Basic 1) (With CD-ROM)
2026-10-18
Literature
Modern manufacturing technology and equipment
2026-10-18