Data Structures and Algorithms in Java (3rd Wiley International Edition) - US edition ISBN is 0471469831
Michael T. Goodrich, Roberto Tamassia
$128.95 (includes GST)
Hardcover package 704
10%Off Retail Price
Usually ships within 3-4 business days.
John Wiley & Sons,2003/11/01
| Add to Shopping Cart
Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation
New and expanded coverage of recursion
Data structures are presented using ADTs and their implementations
Develops a wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in Java
Table of Contents
1. Java Programming.
2. Object-Oriented Design.
3. Analysis Tools.
4. Stacks, Queues, and Recursion.
5. Vectors, Lists, and Sequences.
7. Priority Queues.
8. Maps and Dictionaries.
9. Search Trees.
10. Sorting, Sets and Selection.
11. Text Processing.
Appendix: Useful Mathematical Facts.
Professors Goodrich and Tamassia are well-recognized researchers in algorithms and data structures, having published many papers in this field, with applications to Internet computing, information visualization, computer security, and geometric computing. They have served as principal investigators in several joint projects sponsored by the National Science Foundation, the Army Research Office, and the Defense Advanced Research Projects Agency. They are also active in educational technology research, with special emphasis on algorithm visualization systems.
Michael Goodrich received his Ph.D. in computer science from Purdue University in 1987. He is currently a professor in the Department of Computer Science at University of California, Irvine. Previously, he was a professor at Johns Hopkins University. He is an editor for the International Journal of Computational Geometry & Applications and Journal of Graph Algorithms and Applications.
Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 1988. He is currently a professor in the Department of Computer Science at Brown University. He is editor-in-chief for the Journal of Graph Algorithms and Applications and an editor for Computational Geometry: Theory and Applications. He previously served on the editorial board of IEEE Transactions on Computers.