Data Structures

[Sean Casey]

I'm looking for a good book that covers data structures in Java. If anyone has any recommendations please let me know. I've already been to the bunkhouse. There isn't anything there for me. Thanks.

[Roseanne Zhang]

My suggestion is reading Data Structure or Algorithm books language independent. You will learn a lot more in that way.
Here is an interesting discussion, and a Java book link is mentioned too:
Data Structure and Algorithm discussion
Thanks!
Roseanne
Join our SCJD Study Group when certified
[This message has been edited by Roseanne Zhang (edited February 04, 2001).]

[Sean Casey]

Thanks for your help Roseanne.

[Sean MacLean]

Though a language independant book will certainly do the trick, you should consider a Java-based book for the simple fact that many books relate their code to C or C++. The probelm here is that lined list implementations, an the like, as described in these texts will most likely be based on using pointers. In Java, however, you need to use iterator objects since you do not have access to pointers directly. A small detail, but it affects the implementation of lists, trees, etc. This book served me well during my CS degree.
Data Structures & Algorithm Analysis in Java
by Mark Allen Weiss
Just a thought.
Sean

[Roseanne Zhang]

When I said language independent, which means no specific programming language should be used, include c/c++/Pascal/ada/Java/Fortran/Lisp/etc...
The language neutral books usually use psuedo code, which can help you thinking in more abstract way. Your knowledge gained will last beyond Java or any other programming languages.
If you use a book using c/c++ or Fortran, of course you'd better use one using Java. At least, it is more practical for now.
Roseanne

[Roseanne Zhang]

Language comes and goes, the Data Structure and Algorithm you learned will last your life time.
Even my previous Graph theory practice was in C, some 8-9 years ago, and never used it in between. But I accomplished a very efficient and very OO Java project using Graph theory in my last job assignment in a very short time period. My boss and I were very proud of the accomplishment.
Roseanne

[Steve Fahlbusch]

For data structures and algorithms, I still find that the Kunth series (fundamental algorithms, semi-numerical algorithms, and sorting and searching) for me is still the best. I have written in more languages then I care to remember, but I still find myself coming back to these books no matter what language I am writting.

[Roseanne Zhang]

I think you are talking about Dr. Don Knuth, the Turing Award winner: http://www-cs-faculty.stanford.edu/~knuth/
You are absolutely right about him and his books.
Roseanne
[This message has been edited by Roseanne Zhang (edited February 05, 2001).]

[Steve Fahlbusch]

Roseanne,
Yep, It's Donald E Knuth.
When I started cs and used his book it was PL/1 and Kwilt (quilt) over the years I have taught Data Strucures classes and Algorthim classes in pascal, c, c++, ada and java. As I see it, the Patterns book by the gang of four is going to be one of those classics that will be used for the next 40 or so years.
Steve

[Roseanne Zhang]

Hi, Steve
There is a problem in Gang of Four's book. They use C++, it will make the book last shorter, if c++ totally goes out of the picture. The language neutral one lasts much longer. Like the Knuth's book or the MIT's Algorithm book.
Of course, they might print another edition using something different sometimes later.
Roseanne