PRODUCT SUPPORT ANNOUNCEMENT
See the latest about COVID-19 shipping availability and video/Web Edition load errors. Learn more.
About the Book
Programming Abstractions in Java provides the following features to facilitate learning:
Prepare students to bridge the gap between the future of the high-tech industry and the short supply of trained developers and engineers
Help students solve problems in a new way using the “client-first approach”
For courses in Java Data Structures.
Programming Abstractions in Java: A Client-First Approach
Programming Abstractions in Java is intended for use in the second programming course in most college or university curriculum. Stanford University’s Eric Roberts employs a novel strategy called the client-first approach while maintaining full coverage of the CS2 curriculum. In the traditional approach, students learn how to use a particular data structure, how to implement it, and what its performance characteristics are—all at the same time. Roberts exposes the weakness of this model. In short, students are trying to understand how a structure is implemented before they have mastered how one would use that structure in an application.
With Programming Abstractions in Java and Roberts’s client-first approach, students learn how to use the full set of collection classes before they tackle any implementation issues. By tackling compelling, real-world assignments in which they use the collection classes as clients, students gain a firm sense of the underlying data model and how each structure can be used. Once they have had time to master the client-side perspective, students are ready to explore the range of possible implementations and their associated computational characteristics. They can also begin to learn the software development skills so desperately needed in the technology industry today.
1. Overview of Java
7. Classes and Objects
9. Recursive Strategies
10. Backtracking Algorithms
11. Algorithmic Analysis
12. Efficiency and Representation
13. Linear Structures
18. Expression Trees
19. Using Function as Data