Data Structures and Problem Solving Using Java
Mark Allen WeissBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
This book provides a practical introduction to data structures with an emphasis on 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 its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.
The Fourth Edition features many new updates as well as new exercises.
Synopsis
This text for a two-semester sequence in computer science introduces data structures and algorithm analysis, focusing on abstract thinking and problem solving. Part I introduces Java and object-oriented programming, and Part II discusses Big-Oh and algorithmic paradigms. Part III provides case studies, Part IV presents data structure implementations, and Part V contains material suitable for a more advanced course. Students should have previous knowledge of either an object-oriented or procedural programming language. This second edition includes a revised chapter on inheritance, rewritten code illustrating both generic and Collections interfaces, and an ongoing example of a Collections implementation.
Annotation c. Book News, Inc., Portland, OR (booknews.com)