9780672324536

Data Structures and Algorithms in Java

by
  • ISBN13:

    9780672324536

  • ISBN10:

    0672324539

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 2002-11-06
  • Publisher: Sams Publishing

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $10.50
    Check/Direct Deposit: $10.00
List Price: $64.99 Save up to $16.25
  • Rent Book $48.74
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

Data Structures and Algorithms in Java, Second Editionis 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.

Author Biography

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.

Table of Contents

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.

Rewards Program

Write a Review