Data Structures and Algorithms in Java (2nd Edition) [Hardcover]

Robert Lafore (Author)

Book Description

Publication Date: November 16, 2002 | ISBN-10: 0672324539 | ISBN-13: 978-0672324536 | Edition: 2

Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book even more useful.

 

Educational Supplement

Suggested solutions to the programming projects found at the end of each chapter are made available to instructors at recognized educational institutions. This educational supplement can be found at www.prenhall.com, in the Instructor Resource Center.

 

 

Editorial Reviews

About the Author

Robert Lafore has degrees in Electrical Engineering and Mathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best-selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course and Object-Oriented Programming in C++. Earlier best-selling titles include Assembly Language Primer for the IBM PC and XT and (back at the beginning of the computer revolution) Soul of CP/M.

Product Details

• Hardcover: 800 pages
• Publisher: Sams; 2 edition (November 16, 2002)
• Language: English
• ISBN-10: 0672324539
• ISBN-13: 978-0672324536
• Product Dimensions: 9.1 x 7.8 x 2 inches
• Shipping Weight: 3.4 pounds (View shipping rates and policies)
• Average Customer Review: 4.6 out of 5 stars  See all reviews (33 customer reviews)
• Amazon Best Sellers Rank: #177,397 in Books (See Top 100 in Books)
  • #10 in Books > Computers & Technology > Programming > Algorithms > Data Structures

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

37 of 39 people found the following review helpful:

5.0 out of 5 stars Great Book on Data Structures, April 9, 2003

By 

seamusmc (Pittsburgh, PA United States) - See all my reviews

This review is from: Data Structures and Algorithms in Java (2nd Edition) (Hardcover)

This is an excellent book on data structures and algorithms and would be a great addition to a student's text book. Fortunately Lafore does not dwell on the algorithm analysis as many data structures books do. This is a plus for me, as most texts on the subject get the reader bogged down in the analysis portion of the subject matter. Note: algorithm analysis is a very important subject I just don't believe it should be taught in parallel with data structures to the extent it is. Its easier for me and many others to first learn how to implement data structures and get a feel for their performance then move on to in-depth analysis.

In this book you'll learn the more important data structures without the heavy mathematics many algorithm and data structure books torture readers with. The book is written in very accessible language and the applets really help the inexperienced see the algorithms in action.

As I mentioned this book does not cover algorithm analysis in detail. A step up from this book would be one of Sedgewick's books which provides more detail on the analysis front and some really 'tight' implementations. A good book that focuses on Algorithm Analysis is Intro to Algorithms by Cormen. You better have your math skills up to snuff for the Cormen book however.

30 of 31 people found the following review helpful:

5.0 out of 5 stars Excellent book, February 8, 2003

By 

Thomas Paul (Plainview, NY USA) - See all my reviews
(VINE VOICE)    (REAL NAME)   

This review is from: Data Structures and Algorithms in Java (2nd Edition) (Hardcover)

Just about every Computer Science program requires a course called "Data Structures and Algorithms". In order to become a programmer you must understand the information provided in this course. This book was written as a textbook for a "Data Structures and Algorithms" course and all the expected topics are covered; arrays, queues, stacks, linked lists, trees, hash tables, heaps, sorting, recursion, and searching. Whether you are a teacher looking for a text, a student who wants a better text than the required one, or just someone who wants to learn more about programming, this book is a very good choice. By using Java, all the complications of C++ are eliminated and the author's crystal clear explanations come shining through. And the author's explanations and examples are excellent. For example, the chapter on link lists explains what a linked list is, what problems it is supposed to solve and what problems it fails to solve, and then shows how to implement your own link list. The author provides a set of applets to visually illustrate the topics covered in the book. There are questions at the end of each chapter and answers are provided. This book is not going to explain the Collection classes or help you learn the API. What this book will do is help you get a deeper understanding of what data structures are, how they work, and what performance sacrifices must be made in order to achieve better overall performance in your programs.

11 of 11 people found the following review helpful:

4.0 out of 5 stars Good Introduction to Data Structures, August 10, 2003

By 

Ted (United States) - See all my reviews
(REAL NAME)   

This review is from: Data Structures and Algorithms in Java (2nd Edition) (Hardcover)

This book is a good introduction to data structures, and would do nicely as an undergraduate college text. It does not have the rigor, however, for an advanced data structures class as might be expected in graduate-level courses. While the author provides plenty of pictures and descriptions to run online applets, the applets were nearly impossible to find on the web. They are not at the location as stated in the book. Even without using the applets though, there are plenty of good diagrams in the book to follow.

So, get this book if you want a nice introduction to the most common data structures, but don't get this book if you are looking for the "end-all" of data structures, or a rigorous approach to defining the complexity/performance associated with the data structures; You'll have to look elsewhere for that.