New Material Keeps the Text Comprehensive and Up-to-Date NEW! An all-new chapter uses the new language features available in Java 8 to discuss the core concepts of functional programming. Focused on concepts rather than language features, the all-new Chapter 19 provides an introduction to several new Java 8 constructs, but not a comprehensive coverage of all new language features. This provides flexibility to instructors, since functional programming features can be covered as an advanced independent topic, incorporated along the way, or skipped entirely. Instructors can choose to start covering functional constructs along with traditional constructs as early as Chapter 6. NEW! A new section on images and 2D pixel array manipulation reflects the increasing popularity of image manipulation and will be particularly helpful for students taking AP courses. Pedagogical Features Help Students Apply What They’ve Learned REVISED! Expanded self-checks and programming exercises have been added to several chapters. Approximately fifty total problems and exercises per chapter are included in the text, all of which have been class-tested with real students, with solutions provided for instructors online. Case studies at the end of most chapters teach students how to develop a complex program in stages and how to test each program as it is being developed. This structure allows instructors to demonstrate each new programming construct in a rich context that can’t be achieved with short code examples. A Layered, Gradual Approach Containing Two Courses’ Worth of Material A uniquely layered approach means that new concepts are introduced gradually, allowing students to expand their understanding at a manageable pace. Extended sections cover all of the topics from our second course in computer science, making the book usable for a two-course sequence. Chapters 12-18 explore recursion, searching and sorting, stacks and queues, collection implementation, linked lists, binary trees, hash tables, heaps, and more. Chapter 12 also includes a section on recursive backtracking, a powerful technique for exploring a set of possibilities for solving problems such as 8 Queens and Sudoku.