Title:
Data abstraction and problem solving with Java : walls and mirrors
Personal Author:
Edition:
Updated ed.
Publication Information:
Boston, Mass. : Pearson Addison Wesley, 2004
ISBN:
9780321197177
Added Author:
Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010046311 | QA76.73.J38 C37 2004 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
Provides a focus on the concepts of data abstraction and data structures for students at the introductory level. This book accounts for the strengths and weaknesses of Java language and uses a pedagogical approach to make the material student-friendly. It focuses on object-oriented concepts, including encapsulation, inheritance, and polymorphism.
Table of Contents
| I Problem-Solving Techniques |
| 1 Principles of Programming and Software Engineering |
| 2 Recursion: The Mirrors |
| 3 Data Abstraction: The Walls |
| 4 Linked Lists |
| 5 Recursion as a Problem-Solving Technique |
| II Problem Solving With Abstract Data Types |
| 6 Stacks |
| 7 Queues |
| 8 Class Relationships |
| 9 Algorithm Efficiency and Sorting |
| 10 Trees |
| 11 Tables and Priority Queues |
| 12 Advanced Implementation of Tables |
| 13 Graphs |
| 14 External Methods |
| Appendix A Review of Java Fundamentals |
| Appendix B Unicode Character Codes |
| Appendix C Java Resources on the WWW |
| Appendix D Mathematical Induction |
