Data Structures with Java
Published on 25. November 2003
Book
Paperback/Softback
700 pages
978-0-13-093374-4 (ISBN)
Description
For a freshman/sophomore-level course in Data Structures in Computer Science.
This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.
This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 235 mm
Width: 178 mm
Weight
1040 gr
ISBN-13
978-0-13-093374-4 (9780130933744)
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
New editions
John R. Hubbard | Anita Huray
Data Structures with Java
Book
10/2003
Prentice Hall
€48.27
Shipment within 15-20 days
Persons
John R. Hubbard is Professor- of Mathematics and Computer Science at the University of Richmond.
Anita Huray is Director of the Computer Science Laboratories at the University of Richmond.
Anita Huray is Director of the Computer Science Laboratories at the University of Richmond.
Content
(NOTE: Each chapter contains a Chapter Summary, Exercises, Programming Problems, Projects, and Review Questions.)
1. Object-Oriented Programming.
2. Abstract Data Types.
3. Arrays.
4. Linked Structures.
5. Stacks.
6. Queues.
7. Collections.
8. Lists.
9. Hash Tables.
10. Recursion.
11. Trees.
12. Binary Trees.
13. Search Trees.
14. Heaps and Priority Queues.
15. Sorting.
16. Graphs.
Appendix A: Answers and Hints.
Appendix B: Java Review.
Appendix C: Essential Mathematics.
Appendix D: The Java Collections Framework.
Appendix E: References.
1. Object-Oriented Programming.
2. Abstract Data Types.
3. Arrays.
4. Linked Structures.
5. Stacks.
6. Queues.
7. Collections.
8. Lists.
9. Hash Tables.
10. Recursion.
11. Trees.
12. Binary Trees.
13. Search Trees.
14. Heaps and Priority Queues.
15. Sorting.
16. Graphs.
Appendix A: Answers and Hints.
Appendix B: Java Review.
Appendix C: Essential Mathematics.
Appendix D: The Java Collections Framework.
Appendix E: References.