Data Structures and Problem Solving Using Java: International Edition - Couverture souple

Weiss, Mark A.

Couverture souple

ISBN 10 : 0321312554 ISBN 13 : 9780321312556

Editeur : Pearson, 2005

Synopsis

This book provides a practical introduction to data structures from a viewpoint of abstract thinking and problem solving, as well as the use of Java.   It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from it’s implementation (how to actually program that structure) into different parts of the book. Part I (Tour of Java), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, but implementation of data structures is not shown until Part IV (Implementations),  forcing the reader to think about the functionality of the data structures before the hash table is implemented.

 

The third edition of Data Structures and Problem Solving Using Java incorporates the enhancements of Java 5.0.  It includes coverage of generic programming, and content on the design of generic collection classes. This book is appropriate for readers who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts.

A propos du livre

Quatrième de couverture

Data Structures and Problem Solving Using Java teaches data structures and algorithms from the perspective of abstract thinking and problem solving. In this text, experienced author and educator Mark Allen Weiss takes a unique approach by clearly separating the specification and implementation of data structures. Dr. Weiss presents the interface and running time of data structures in Part II of the book. Then, he provides the opportunity for students to use the data structures in a variety of practical examples before introducing the implementations in Part IV. By first gaining a familiarity with the interfaces and uses of data structures, readers will be able to think more abstractly about the subject matter.

Features

• Contains extensive sample code using Java 1.1, which is available over the Internet and has been tested and reviewed by a professional programmer for accuracy.
• Provides an introduction to Java in Part I and also covers Graphical User Interfaces (GUI's) in an appendix.
• Includes pedagogical aids such as margin notes and comprehensive end-of-chapter material to help readers grasp challenging concepts.
• Offers flexibility in topic coverage by minimizing dependencies among the different chapters.

0201549913B04062001

Présentation de l'éditeur

This book provides a practical introduction to data structures from a viewpoint of abstract thinking and problem solving, as well as the use of Java.   It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from it’s implementation (how to actually program that structure) into different parts of the book. Part I (Tour of Java), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, but implementation of data structures is not shown until Part IV (Implementations),  forcing the reader to think about the functionality of the data structures before the hash table is implemented.

 

The third edition of Data Structures and Problem Solving Using Java incorporates the enhancements of Java 5.0.  It includes coverage of generic programming, and content on the design of generic collection classes. This book is appropriate for readers who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts.

Détails de l'édition

• Éditeur: Pearson
• Date d'édition: 2005
• Langue: anglais
• ISBN 10: 0321312554
• ISBN 13: 9780321312556
• Reliure: Broché
• Numéro d'édition: 3
• Nombre de pages: 960
• Coordonnées du fabricant: non disponible