
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book is based on the classic "Walls and Mirrors" approach used in the best-selling Data Abstraction and Problem Solving with 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). The authors cover key object-oriented concepts, including encapsulation, inheritance, and polymorphism; the focus of the book, however, remains on data abstraction. They also introduce the analysis of algorithms and Big "O" notation. For those who know a different language or who need a refresher, an appendix covering basic Java syntax is also provided. 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 the concepts of recursion and data abstraction.
This text investigates the fundamental principles of data abstraction and algorithmic problem solving through the lens of the Java programming language. Authors Frank M. Carrano and Janet J. Prichard utilize the "Walls and Mirrors" pedagogical framework to demystify complex programming concepts. By balancing theoretical abstraction with practical implementation, the authors provide a structured approach to mastering recursion and object-oriented design patterns. The book serves as a comprehensive resource for students and professionals seeking to deepen their understanding of how data structures are modeled and analyzed in modern software development.
What You Will Find
Experts and educators frequently cite this work as a foundational text for computer science curricula due to its clear pedagogical structure. Readers often note the academic density of the prose, which is balanced by consistent examples that reinforce the core concepts of data abstraction.
Page Count:
806
Publication Date:
2000-07-19
Publisher:
Addison Wesley
ISBN-10:
0201702207
ISBN-13:
9780201702200
No comments yet. Be the first to share your thoughts!