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.

• Broad use of Java interfaces—Defines and implements abstract data types (ADTs).

  • Gives students practical experience.

• Substantial treatment of algorithms—Includes their analysis and implementation.

  • Prepares students for advanced courses in computer science.

• Unified Modeling Language (UML)—Uses UML diagrams to summarize classes, interfaces, and their relationships.

  • Helps students see the overall structure of a software design without its distracting details.

• Clear and precise illustrations of program objects.

  • Aids students by providing clear visual images that help with understanding and remembering.

• Explicit use of Abstract Data Types (ADTs).

  • Clarifies for students the distinction between how the type is used and what makes it work.

• Consistent use of Java exception handling.

  • Prepares students to manage larger software projects in more advanced courses.

• Review of arrays and relevant Java support—Includes java.util.Arrays class and the System arraycopy method.

  • Gives students the basis for many implementations.

• Several complete case studies.

  • Shows students how to apply the various concepts presented.

• Spiral approach to difficult topics—Returns to the same concept in different contexts.

  • Helps students develop deeper understanding.

• Implementations that mirror Java Collections Framework (JCF).

  • Clarifies for students how the JCF is structured which makes them feel more comfortable using it.

• Full treatment of the JCF—Enabling advanced Java applications.

  • Gives students the understanding they need of when its classes should be used.

• Clear exposition of abstract classes—Includes the reasons for defining them.

  • Shows students this essential part of the JCF.

• Substantial chapter on recursion—Includes many examples.

  • Increases students' knowledge and understanding of this more difficult topic.

• General trees, binary trees, and search trees—Developed in three separate chapters.

  • Gives students more time to get used to nonlinear data structures and their recursive processing.

• Unified treatment of sorting algorithms—Simplifies their comparisons.

  • Enables students to have more substantial experience with their analysis of algorithms.

• Instructor CD.

  • Provides instructors with valuable course support.

• Companion Website.

  • Allows students to consult a valuable resource.

(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.

Java Data Structures  (Computer Science)

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.

Hubbard and Huray have completely integrated the power of Java to present data structures in the context of the Java Collections Framework, incorporating the principles of object-oriented programming (OOP) throughout the text. Abstraction is presented through abstract data types (ADTs), Unified Modeling Language (UML) diagrams, and Java interfaces and abstract classes. The authors introduce linked structures early, then cover them in greater depth beginning with Chapter 8. In addition, three entire chapters are devoted to trees.

Data Structure with Java covers all the topics of the standard course on data structures, including the main data structures and algorithms recommended by the ACM. Students with a basic preparation in Java or C++. will appreciate the spiral approach used to develop an increasingly sophisticated understanding of abstract topics such as the analysis of algorithms. Other pedagogic features include:

• Extensive review questions, exercises, programming problems, and projects at the end of each chapter to reinforce learning
• A profusion of multicolored diagrams, tables, and other visual aids to illustrate concepts graphically
• Simple, clear source code listings, presented with the syntax coloring found in professional integrated Development Environment (IDE) editors

Interwrite Personal Response System
EduCue, Addison-Wesley & Benjamin Cummings
©2004 | Prentice Hall | Electronic Supplement | Instock
ISBN-10: 0321267354 | ISBN-13: 9780321267351

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.