Data Structures with Java
Seiten
2003
Pearson (Verlag)
978-0-13-093374-4 (ISBN)
Pearson (Verlag)
978-0-13-093374-4 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Teaches the use of direct source code implementations and the use of the Java libraries. This text helps students prepare for Java software solutions by adhering to principles and techniques such as the UML and the Java Collections Framework (JCF). It is intended for a freshman/sophomore-level course in Data Structures in Computer Science.
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.
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.
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.
(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.
| Erscheint lt. Verlag | 25.11.2003 |
|---|---|
| Sprache | englisch |
| Maße | 178 x 235 mm |
| Gewicht | 1040 g |
| Themenwelt | Informatik ► Programmiersprachen / -werkzeuge ► Java |
| Mathematik / Informatik ► Informatik ► Web / Internet | |
| ISBN-10 | 0-13-093374-0 / 0130933740 |
| ISBN-13 | 978-0-13-093374-4 / 9780130933744 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
mit über 150 Workouts in Java und Python
Buch (2023)
Carl Hanser (Verlag)
29,99 €
Einführung, Ausbildung, Praxis
Buch | Hardcover (2023)
Rheinwerk (Verlag)
49,90 €
