Higher Ed. and Vocational >> Engineering and Computer Science >> Computer Science >> Computer Science


Data Structures with Java

Data Structures with Java

Author(s):
  • John R. Hubbard
    • Author: John R. Hubbard
    • ISBN:9789332549395
    • 10 Digit ISBN:9332549397
    • Price:Rs. 840.00
    • Pages:700
    • Imprint:Pearson Education
    • Binding:Paperback
    • Status:Available


    Be the first to rate the book !!

    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.

    Table of Content

    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.
     

    Salient Features

    • Broad use of Java interfaces—Defines and implements abstract data types (ADTs).
    • Substantial treatment of algorithms—Includes their analysis and implementation.
    • Unified Modeling Language (UML)—Uses UML diagrams to summarize classes, interfaces, and their relationships.
    • Clear and precise illustrations of program objects.
    • Explicit use of Abstract Data Types (ADTs).
    • Consistent use of Java exception handling.
    • Review of arrays and relevant Java support—Includes java.util.Arrays class and the System arraycopy method.
    • Several complete case studies.
    • Spiral approach to difficult topics—Returns to the same concept in different contexts.
    • Implementations that mirror Java Collections Framework (JCF).
    • Full treatment of the JCF—Enabling advanced Java applications.
    • Clear exposition of abstract classes—Includes the reasons for defining them.
    • Substantial chapter on recursion—Includes many examples.
    • General trees, binary trees, and search trees—Developed in three separate chapters.
    • Unified treatment of sorting algorithms—Simplifies their comparisons.