Data Structures and Problem Solving Using Java - Couverture rigide

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.

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

Data Structures and Problem Solving Using Java, Second Edition provides a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving, as well as the use of Java.

This text has a clear separation of the interface and implementation to promote abstract thinking. Java allows the programmer to write the interface and implementation separately, to place them in separate files and compile separately, and to hide the implementation details. This book goes a step further: the interface and implementation are discussed in separate 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). Class interfaces are written and used before the implementation is known, forcing the reader to think about the functionality and potential efficiency of the various data structures (e.g., hash tables are written well before the hash table is implemented).