• Author:
  • Goodrich, Michael T.
  • Tamassia, Roberto
• Subject:
  Computer Programming / Software Development
• Published by:
  John Wiley & Sons Inc (US)
• Published:
  26/11/2003
• Price:
  $141.99
• <  Buy this book  >

The third edition of this conceptually elegant and pedagogically innovative text continues to incorporate the object-oriented design paradigm, using Java as the implementation language, while also providing intuition and analysis of fundamental data structures and algorithms. All of this is done in a clear, friendly writing style that uses visuals to introduce and simplify important analytic and mathematical concepts.
* Entirely new chapter on recursion
* Additional exercises on the analysis of simple algorithms
* New case study on parenthesis matching and HTML validation

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.

In addition to their research accomplishments, the authors also have extensive experience in the classroom. For example, Dr. Goodrich has taught data structures and algorithms courses, including Data Structures as a freshman-sophomore level course and Introduction to Algorithms as an upper level course. He has earned several teaching awards in this capacity. His teaching style is to involve the students in lively interactive classroom sessions that bring out the intuition and insights behind data structuring and algorithmic techniques. Dr. Tamassia has taught Data Structures and Algorithms as an introductory freshman-level course since 1988. One thing that has set his teaching style apart is his effective use of interactive hypermedia presentations integrated with the Web.

The instructional Web sites, datastructures.net and algorithmdesign.net, supported by Drs. Goodrich and Tamassia are used as reference material by students, teachers, and professionals worldwide.

1. Java Programming.

2. Object-Oriented Design.

3. Analysis Tools.

4. Stacks, Queues, and Recursion.

5. Vectors, Lists, and Sequences.

6. Trees.

7. Priority Queues.

8. Maps and Dictionaries.

9. Search Trees.

10. Sorting, Sets and Selection.

11. Text Processing.

12. Graphs.

Appendix: Useful Mathematical Facts.

Bibliography.

Index.