Isbn: 9781461266013 - an introduction to data structures and algorithms (19 resultados)

Condición: New.

Condición: As New. Unread book in perfect condition.

PF. Condición: New.

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Condición: New. 2012. Paperback. . . . . .

Condición: New. pp. 620.

Condición: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.

Paperback. Condición: Brand New. 599 pages. 10.00x7.00x1.25 inches. In Stock.

Taschenbuch. Condición: 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.…

Taschenbuch. Condición: 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. …

Condición: new. Questo è un articolo print on demand.

Taschenbuch. Condición: 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. …

Condición: 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.

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Condición: 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..…

Condición: New. PRINT ON DEMAND pp. 620.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Data structures and algorithms are presented at the college level in away that is unique in content and presentation from current availabletexts. A highly accessible format presents algorithms with one pagedisplays that will appeal to both students and teachers of computerscience. The thirteen chapters systematically and comprehensivelycover Models of Computation, Lists, Induction and Recursion, TreesAlgorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a SmallUniverse, Discrete Fourier Transform, Strings, Graphs, ParallelComputation.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 620 pp. Englisch.…