Data Structures and Algorithms in Java
A Project-Based Approach

A hands-on, active learning textbook for CS2 courses.

Dan S. Myers (Author)

9781009260336, Cambridge University Press

Hardback, published 31 October 2024

642 pages
26 x 21 x 3.8 cm, 1.529 kg

'Professor Myers' project-based approach not only motivates students but also offers a practical framework for applying complex concepts effectively. The projects in this text provide context for decision-making and enhance understanding through practical applications. Each project builds a solid foundation fostering thoughtful engagement with challenging material.' Michael Penta, Northern Essex Community College

Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code.

Preface
Algorithms + data structures = programs
1. Java fundamentals
2. Object-oriented programming
3. Project: mindstorms
4. Arrays
5. Searching and an introduction to algorithm analysis
6. Lists
7. Project: particle effects
8. Recursion
9. Project: generative art and fractals
10. Sorting
11. Stacks
12. Project: logic puzzles
13. Queues and buffers
14. Hashing
15. Hash tables
16. Project: Ye olde Shakespearean search engine
17. Binary trees
18. Self-balancing search trees
19. Heaps and priority queues
20. Graph algorithms
21. Project: graph-based recommendation engine
22. Project: twisty little passages
Bibliography
Index.

Subject Areas: Information technology: general issues [UB]