"Focusing on data abstraction and data structures, the second edition of this very successful book continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the next, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of material have helped make this a leading book in the field." --Book Jacket.
This edition of Data Abstraction and Problem Solving with Java: Walls and Mirrors employs the analogies of Walls (data abstraction) and Mirrors (recursion) to teach Java programming design solutions, in a way that beginning students find accessible. The book has a student-friendly pedagogical approach that carefully accounts for the strengths and weaknesses of the Java language. With this book, students will gain a solid foundation in data abstraction, object-oriented programming, and other problem-solving techniques. The full text downloaded to your computer With eBooks you can: search for key concepts, words and phrases make highlights and notes as you study share your notes with friends eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps. Upon purchase, you'll gain instant access to this eBook. Time limit The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.
The second edition, in Java, of the classic Walls and Mirrors approach to programming designs solutions to problems using both data abstraction (the walls) and recursion (the Mirrors).Data Abstraction and Problem Solving with Java: Walls and Mirrors, 2eprovides a focus on the important concepts of data abstraction and data structures in a way that beginning programmers find accessible. The first part of the book covers problem-solving techniques including a review of Java fundamentals, principles of programming and software engineering, recursion and data abstraction, and linked lists. Later chapters focus on problem solving with abstract data types including stacks, queues, algorithm efficiency and sorting, trees, and graphs. This edition contains enhanced material on OO implementation. MARKET: Readers searching for problem solving solutions through abstraction, algorithmic refinement, data structures and recursion.
Data Abstraction and Problem Solving in C++, and is now updated to the Java programming language. It uses the running theme of "Walls and Mirrors" to help make clear the challenging concepts of recursion (the mirrors) and data abstraction (the walls). Authors Carrano and Prichard cover key object-oriented concepts, including encapsulation, inheritance, and polymorphism. However, the focus of the book remains on data abstraction instead of simply Java syntax.
Koffman and Wolfgang introduce data structures in the context of C++ programming. They embed the design and implementation of data structures into the practice of sound software design principles that are introduced early and reinforced by 20 case studies. Data structures are introduced in the C++ STL format whenever possible. Each new data structure is introduced by describing its interface in the STL. Next, one or two simpler applications are discussed then the data structure is implemented following the interface previously introduced. Finally, additional advanced applications are covered in the case studies, and the cases use the STL. In the implementation of each data structure, the authors encourage students to perform a thorough analysis of the design approach and expected performance before actually undertaking detailed design and implementation. Students gain an understanding of why different data structures are needed, the applications they are suited for, and the advantages and disadvantages of their possible implementations. Case studies follow a five-step process (problem specification, analysis, design, implementation, and testing) that has been adapted to object-oriented programming. Students are encouraged to think critically about the five-step process and use it in their problem solutions. Several problems have extensive discussions of testing and include methods that automate the testing process. Some cases are revisited in later chapters and new solutions are provided that use different data structures. The text assumes a first course in programming and is designed for Data Structures or the second course in programming, especially those courses that include coverage of OO design and algorithms. A C++ primer is provided for students who have taken a course in another programming language or for those who need a review in C++. Finally, more advanced coverage of C++ is found in an appendix. Course Hierarchy: Course is the second course in the CS curriculum Required of CS majors Course names include Data Structures and Data Structures & Algorithms
For one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters - each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
Written by a world-renowned expert on programming methodology, and the winner of the 2008 Turing Award, this book shows how to build production-quality programs--programs that are reliable, easy to maintain, and quick to modify. Its emphasis is on modular program construction: how to get the modules right and how to organize a program as a collection of modules. The book presents a methodology effective for either an individual programmer, who may be writing a small program or a single module in a larger one; or a software engineer, who may be part of a team developing a complex program comprised of many modules. Both audiences will acquire a solid foundation for object-oriented program design and component-based software development from this methodology. Because each module in a program corresponds to an abstraction, such as a collection of documents or a routine to search the collection for documents of interest, the book first explains the kinds of abstractions most useful to programmers: procedures; iteration abstractions; and, most critically, data abstractions. Indeed, the author treats data abstraction as the central paradigm in object-oriented program design and implementation. The author also shows, with numerous examples, how to develop informal specifications that define these abstractions--specifications that describe what the modules do--and then discusses how to implement the modules so that they do what they are supposed to do with acceptable performance. Other topics discussed include: Encapsulation and the need for an implementation to provide the behavior defined by the specification Tradeoffs between simplicity and performance Techniques to help readers of code understand and reason about it, focusing on such properties as rep invariants and abstraction functions Type hierarchy and its use in defining families of related data abstractions Debugging, testing, and requirements analysis Program design as a top-down, iterative process, and design patterns The Java programming language is used for the book's examples. However, the techniques presented are language independent, and an introduction to key Java concepts is included for programmers who may not be familiar with the language.
This work focuses on the important concepts of data abstraction and data structures. It also introduces students to java classes along with other basic concepts of object-oriented programming, including inheritance, polymorphism, interfaces and packages.
Multicore microprocessors are now at the heart of nearly all desktop and laptop computers. While these chips offer exciting opportunities for the creation of newer and faster applications, they also challenge students and educators. How can the new generation of computer scientists growing up with multicore chips learn to program applications that exploit this latent processing power? This unique book is an attempt to introduce concurrent programming to first-year computer science students, much earlier than most competing products. This book assumes no programming background but offers a broad coverage of Java. It includes over 150 numbered and numerous inline examples as well as more than 300 exercises categorized as "conceptual," "programming," and "experiments." The problem-oriented approach presents a problem, explains supporting concepts, outlines necessary syntax, and finally provides its solution. All programs in the book are available for download and experimentation. A substantial index of at least 5000 entries makes it easy for readers to locate relevant information. In a fast-changing field, this book is continually updated and refined. The 2014 version is the seventh "draft edition" of this volume, and features numerous revisions based on student feedback. A list of errata for this version can be found on the Purdue University Department of Computer Science website.
