Data Structures and Algorithms in Java, 2nd Edition

About

Features

• Updated to improve clarity and performance, and reflect Sun's latest Java 2 platform releases.

• New questions and exercises at the end of every chapter.

  • Helps students review the material and confirm that they understand it in detail.

• Simple, thorough, example rich coverage of Java data structures and algorithms—Covers arrays, stacks, queues, sorts, linked lists, recursion, binary trees, red-black trees, 2-3-4 trees, external storage, hash tables, heaps, weighted graphs, and more.

  • Illuminates all the algorithms and data structures students will need to manipulate any kind of data with Java.

• Browser-based “Workshop Applet” tool visualises algorithms and data structures—Simple browser-based software shows students how data structures and algorithms look and work.

  • Brings algorithms and data structures to life, making them easier than ever for students to understand.

Description

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.

Sample Content

Table of Contents

• Introduction. 
• 1. Overview. 
• 2. Arrays. 
• 3. Simple Sorting. 
• 4. Stacks and Queues. 
• 5. Linked Lists. 
• 6. Recursion.
• 7. Advanced Sorting. 
• 8. Binary Trees. 
• 9. Red-Black Trees.
• 10. 2-3-4 Trees and External Storage.
• 11. Hash Tables.
• 12. Heaps.
• 13. Graphs.
• 14. Weighted Graphs.
• 15. When to Use What.
• Appendix A. Running the Workshop Applets and Example Programs.
• Appendix B. Further Reading.
• Appendix C. Answers to Questions.
• Index.
  

Updates

Submit Errata