Condizione: Very Good. Grade 3 out 5 points. This is a used book. Book has wear on cover and pages. May have personalized notes/names, stickers/labels. Has no markings on pages. May not include extra materials like access codes, CDs, accessories, etc. All orders ship by next business day! We are a small company and very thankful for your business!
Hardcover. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Hardcover. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
EUR 35,83
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 620 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Condizione: New. pp. 620.
EUR 37,24
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. pp. 620.
Condizione: New.
Condizione: As New. Unread book in perfect condition.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,50
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 60,50
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 57,38
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
EUR 60,04
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
EUR 66,60
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 72,73
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2012. Paperback. . . . . .
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 73,81
Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2001. Hardcover. . . . . .
Condizione: New. pp. 620.
Condizione: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
Condizione: New. 2001. Hardcover. . . . . . Books ship from the US and Ireland.
EUR 85,89
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.
EUR 50,35
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. An Introduction to Data Structures and Algorithms | J. A. Storer | Taschenbuch | xvii | Englisch | 2012 | Birkhäuser | EAN 9781461266013 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
EUR 61,89
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
Lingua: Inglese
Editore: Birkhäuser Boston Nov 2012, 2012
ISBN 10: 1461266017 ISBN 13: 9781461266013
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 53,49
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Data structures and algorithms are presented at the college levelin a highly accessible format that presents material with one-pagedisplays in a way that will appeal to both teachers and students. Thethirteen chapters cover: Models of Computation, Lists, Induction andRecursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees,Sets Over a Small Universe, Graphs, Strings, Discrete FourierTransform, Parallel Computation.Key features: Complicated concepts are expressed clearly in asingle page with minimal notation and without the 'clutter' of thesyntax of a particular programming language; algorithms are presentedwith self-explanatory 'pseudo-code.' \* Chapters 1-4 focus onelementary concepts, the exposition unfolding at a slower pace. Sampleexercises with solutions are provided. Sections that may be skippedfor an introductory course are starred. Requires only some basicmathematics background and some computer programming experience. \*Chapters 5-13 progress at a faster pace. The material is suitable forundergraduates or first-year graduates who need only review Chapters 1-4. \* This book may be used for a one-semester introductory course(based on Chapters 1-4 and portions of the chapters on algorithmdesign, hashing, and graph algorithms) and for a one-semester advancedcourse that starts at Chapter 5. A year-long course may be based onthe entire book. \* Sorting, often perceived as rather technical, isnot treated as a separate chapter, but is used in many examples(including bubble sort, merge sort, tree sort, heap sort, quick sort,and several parallel algorithms). Also, lower bounds on sorting bycomparisons are included with the presentation of heaps in the contextof lower bounds for comparison-based structures. \* Chapter 13 onparallel models of computation is something of a mini-book itself, anda good way to end a course. Although it is not clear what parallel 620 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 82,57
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 620 66:B&W 7 x 10 in or 254 x 178 mm Perfect Bound on White w/Gloss Lam.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 79,49
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 620.
Da: moluna, Greven, Germania
EUR 48,37
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists,.