Object-Oriented Data Structures Using Java

Daniel-T Joyce

,

Nell Dale

Chip Weems

Note moyenne 
Daniel-T Joyce et Nell Dale - Object-Oriented Data Structures Using Java.
Object-Oriented Data Structures Using Java tackles the classic data structures and object-oriented concepts with an unparalleled clarity and accessibility.... Lire la suite
41,70 € Neuf
Expédié sous 2 à 4 semaines
Livré chez vous entre le 16 mai et le 30 mai
En librairie

Résumé

Object-Oriented Data Structures Using Java tackles the classic data structures and object-oriented concepts with an unparalleled clarity and accessibility. The authors have constructed an exceptional text that challenges and supports the reader as it provides a wealth of meaningful case studies and provocative examples. Object-Oriented Data Structures Using Java guides the reader through the rigor of standard data structures by presenting essential concepts from the logical, application, and implementation levels. With a focus on abstract data types, this book provides a rich introduction to encapsulation, inheritance, and polymorphism. Object-Oriented Data Structures Using Java contains a number of helpful features that facilitate the reader's understanding of important concepts, while actively engaging the reader in the learning process. • A chapter on Software Engineering introduces students to the innovative and ever-changing Software Engineering field. • Case Studies support the material presented in the text, reinforce main concepts, and enrich the students' learning experience. These case studies include Java GUI approaches (using Swing). • Testing Techniques, Unified Modeling Language (UML) class diagrams, and object-oriented approaches are covered throughout the book. • CRC cards are introduced and support many of the Case Studies.

Sommaire

    • Software engineering
    • Data design and implementation
    • ADTs unsorted list and sorted list
    • ADTs stack and queue
    • Linked structures
    • Lists plus
    • Programming with recursion
    • Binary search trees
    • Priority queues, heaps, and graphs
    • Sorting and searching algorithms

Caractéristiques

  • Date de parution
    22/01/2002
  • Editeur
  • ISBN
    0-7637-1079-2
  • EAN
    9780763710798
  • Présentation
    Relié
  • Nb. de pages
    825 pages
  • Poids
    1.515 Kg
  • Dimensions
    19,3 cm × 23,2 cm × 3,7 cm

Avis libraires et clients

Avis audio

Écoutez ce qu'en disent nos libraires !

Des mêmes auteurs

Derniers produits consultés

41,70 €