Data structures with Java
著者
書誌事項
Data structures with Java
Pearson Prentice Hall, c2004
注記
Includes bibliographical references (p. 599-602) and index
内容説明・目次
内容説明
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.
目次
(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.
「Nielsen BookData」 より