Data Structures and Algorithms in Java
2nd Edition
Published on 6. September 2017
800 pages
978-0-13-484799-3 (ISBN)
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.
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.
All prices
More details
Edition
2nd edition
Language
English
Place of publication
Boston
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
File size
49,36 MB
ISBN-13
978-0-13-484799-3 (9780134847993)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Robert Lafore
Data Structures and Algorithms in Java
Book
11/2002
2nd Edition
Sams Publishing
€63.13
Shipment within 10-20 days
Person
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.
Content
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.
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.
