Data Structures And Algorithms In Java, 2nd Ed

In this book, the authors 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 this is done in a clear, friendly writing style that uses pictures and simplified mathematical analyses to justify important analytic concepts.

Table of contents :
· Java Programming
· Object-Oriented Design
· Analysis Tools
· Stacks, Queues, and Deques
· Vectors, Lists, and Sequences
· Trees
· Priority Queues
· Dictionaries
· Search Trees
· Sorting, Sets, and Selection
· Text Processing
· Graphs
· Useful Mathematical Facts
Bibliography
Index



Market Description :
· Computer Programmers
· Software Engineers
· Scientists


About Author :
Professor Goodrich and Tamassi are well-recognized researchers in data structures and algorithms, having published many papers in this field, with applications to internet computing, information visualization, geographic information systems, computer security, and computer-aided layout. They have an extensive record of research collaboration and 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 and infrastructure support for distance learning.

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 John Hopkins University, and codirector of the Johns Hopkins Center for Algorithms Engineering. He is an editor for the International Journal of Computational Geometry & Applications, Journal of Computational and System Sciences, 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 also an editor for Computational Geometry: Theory and Applications, and the Journal of Graph Algorithms and Applications, and previously served on the editorial board of IEEE Transactions on Computers.