Imagen 1 de 1

Data Structures and Algorithms in Java : A Project-Based Approach by Dan S. Myers (2024, Hardcover)

Great Book Prices Store (340927)

96,7% de votos positivos

Precio:

USD77,68

Aproximadamente66,54 EUR

+ USD20,79 de envío

Entrega prevista: lun. 25 ago. - mar. 9 sep.

Devoluciones:

No admite devoluciones pero está respaldado por la Garantía al cliente de eBay.

Estado:

Nuevo

Data Structures and Algorithms in Java : A Project-based Approach, Hardcover by Myers, Dan S., ISBN 1009260332, ISBN-13 9781009260336, Brand New, Free shipping in the US 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.

Acerca de este artículo

Product Identifiers

PublisherCambridge University Press

ISBN-101009260332

ISBN-139781009260336

eBay Product ID (ePID)15065563284

Product Key Features

Number of Pages571 Pages

Publication NameData Structures and Algorithms in Java : a Project-Based Approach

LanguageEnglish

Publication Year2024

SubjectComputer Science, General

TypeTextbook

AuthorDan S. Myers

Subject AreaMathematics, Computers

FormatHardcover

Dimensions

Item Height1.5 in

Item Length10.2 in

Item Width8.3 in

Additional Product Features

Dewey Edition23

Reviews'An intuitive and engaging introduction to foundational content; a terrific source for anyone looking to dive deeper into computer science!' Remzi Arpaci-Dusseau, University of Wisconsin, Madison

IllustratedYes

Dewey Decimal005.73

Table Of ContentPreface; 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.

SynopsisA 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.

LC Classification NumberQA76.9.D35M9 2024