Data Structures and Algorithms in Java - Dan S. Myers

Data Structures and Algorithms in Java

A Project-Based Approach

(Autor)

Buch | Hardcover
571 Seiten
2024
Cambridge University Press (Verlag)
978-1-009-26033-6 (ISBN)
68,55 inkl. MwSt
A hands-on undergraduate textbook covering all core data structures and algorithms topics with an emphasis on real-world projects. Accessibly written and includes over 250 'Try It Yourself' boxes, more than 500 end-of-chapter problems, and additional interview question sections.
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.

Dan S. Myers is an Associate Professor of Computer Science at Rollins College in Winter Park, Florida, where he has taught Data Structures and Algorithms for ten years.

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.

Erscheint lt. Verlag 30.9.2024
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Themenwelt Informatik Theorie / Studium Algorithmen
ISBN-10 1-009-26033-2 / 1009260332
ISBN-13 978-1-009-26033-6 / 9781009260336
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich