{"product_id":"9780817642532","title":"An Introduction to Data Structures and Algorithms","description":"\u003ch1\u003eAn Introduction to Data Structures and Algorithms\u003c\/h1\u003e \u003ch2\u003eStorer, J.A.; Cherniavsky, John C.\u003c\/h2\u003e \u003cp\u003eData structures and algorithms are presented at the college level \nin a highly accessible format that presents material with one-page \ndisplays in a way that will appeal to both teachers and students. The \nthirteen chapters cover: Models of Computation, Lists, Induction and \nRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, \nSets Over a Small Universe, Graphs, Strings, Discrete Fourier \nTransform, Parallel Computation. \n    Key features: Complicated concepts are expressed clearly in a \nsingle page with minimal notation and without the \"clutter\" of the \nsyntax of a particular programming language; algorithms are presented \nwith self-explanatory \"pseudo-code.\" * Chapters 1-4 focus on \nelementary concepts, the exposition unfolding at a slower pace. Sample \nexercises with solutions are provided. Sections that may be skipped \nfor an introductory course are starred. Requires only some basic \nmathematics background and some computer programming experience. * \nChapters 5-13 progress at a faster pace. The material is suitable for \nundergraduates or first-year graduates who need only review Chapters 1 \n-4. * This book may be used for a one-semester introductory course \n(based on Chapters 1-4 and portions of the chapters on algorithm \ndesign, hashing, and graph algorithms) and for a one-semester advanced \ncourse that starts at Chapter 5. A year-long course may be based on \nthe entire book. * Sorting, often perceived as rather technical, is \nnot treated as a separate chapter, but is used in many examples \n(including bubble sort, merge sort, tree sort, heap sort, quick sort, \nand several parallel algorithms). Also, lower bounds on sorting by \ncomparisons are included with the presentation of heaps in the context \nof lower bounds for comparison-based structures. * Chapter 13 on \nparallel models of computation is something of a mini-book itself, and \na good way to end a course. Although it is not clear what parallel\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Birkhäuser\u003c\/p\u003e \u003cp\u003ePublication Date: 2001-11-09\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9780817642532\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4612-0075-8\u003c\/p\u003e \u003cp\u003eDimensions: 254cm x178cm\u003c\/p\u003e \u003cp\u003ePages: 599\u003c\/p\u003e ","brand":"Birkhäuser Boston","offers":[{"title":"Default Title","offer_id":47392406831244,"sku":"9780817642532","price":49.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9780817642532.jpg?v=1775767599","url":"https:\/\/lateknightbooks.com\/products\/9780817642532","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}