Data Structures and Algorithms in Java

Front Cover
Wiley, 2004 - Computers - 681 pages
1 Review
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

From inside the book

 

63 pages matching Abstract Data Type in this book

Page xvi

Page xvi

Where's the rest of this book?

Results 1-3 of 63

What people are saying - Write a review

LibraryThing Review

User Review  - daschaich - LibraryThing

Third edition is much improved: When I learned that this was the required book for my introductory data structures class this semester, I was somewhat worried by the large number of very negative ... Read full review

Contents

Java Programming
2
ObjectOriented Design
56
Analysis Tools
100
Copyright

11 other sections not shown

Other editions - View all

Data Structures and Algorithms in Java
Michael T. Goodrich,Roberto Tamassia,Michael H. Goldwasser
Limited preview - 2014
Data Structures and Algorithms in Java
Michael T. Goodrich,Roberto Tamassia
Snippet view - 1998
Data Structures and Algorithms in Java
Michael T. Goodrich,Roberto Tamassia
No preview available - 2010
View all »

Common terms and phrases

Abstract Data Type array AVL tree big-Oh binary search tree BTPosition bucket array Code Fragment computing constructor data structure define denote deque Describe dictionary double doubly linked list edges element stored empty entry with key Euler tour example execution external node Figure function given heap height Input insert instance variables integer interface isBmpty iterator Java program left child list structure loop merge-sort method null number of elements number of nodes O(log Output parameter perform position postorder traversal preorder traversal priority queue problem proper binary tree Proposition protected void pseudo-code public boolean public class public Object public static public void queue ADT quick-sort recursive call red-black tree reference remove removeMin right child root runs in O(n Section sequence shown in Code singly linked list skip list splay tree splaying stack statement string subtree takes O(1 throws InvalidPositionException update vertex vertices worst-case

About the author (2004)

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.

Bibliographic information

QR code for Data Structures and Algorithms in Java
TitleData Structures and Algorithms in Java
Worldwide series in computer science
AuthorsMichael T. Goodrich, Roberto Tamassia
Edition3, illustrated
PublisherWiley, 2004
Original fromthe University of California
DigitizedNov 19, 2009
ISBN0471469831, 9780471469834
Length681 pages
Subjects ›  › 

Computers / Programming / General
Computers / Programming Languages / Java
  
Export CitationBiBTeX EndNote RefMan