An Introduction to Data Structures and Algorithms

4,5 valoración promedio
( 2 valoraciones por Goodreads )
 
9781461266013: An Introduction to Data Structures and Algorithms
Ver todas las copias de esta edición ISBN.
 
 
Críticas:

"Intended as a teaching aid for college and graduate-level courses on data structures, the material in this book has been aligned to support the lecture style. All the algorithms in the book are provided in pseudocode, so that students can implement the algorithms in a programming language of their choice. The book addresses basic as well as advanced algorithms in data structures, with introductory but adequate material about parallel computing models also provided... At the end of each chapter, there are sample exercises with solutions that help students to test their understanding of the book. There are also unsolved exercises that can be of use to instructors for course assignments... Each chapter also includes notes at the end, providing a good summary of the topics covered, which is very useful for students taking the course. The author has done a commendable job in outlining various algorithms for a problem, and also in comparing their merits... [The] approach of the book is easy to understand for students with a strong mathematical background."

―ACM Computing Reviews

Reseña del editor:

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, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the "clutter" of the syntax of a particular programming language; algorithms are presented with self-explanatory "pseudo-code." * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates 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 algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not 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 by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel

"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar nuevo Ver libro

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Otras ediciones populares con el mismo título

9780817642532: An Introduction to Data Structures and Algorithms (Progress in Computer Science and Applied Logic)

Edición Destacada

ISBN 10:  0817642536 ISBN 13:  9780817642532
Editorial: Birkhäuser, 2001
Tapa dura

9788184890815: An Introduction to Data Structures and Algorithms

Spring..., 2009
Tapa blanda

9783764342531: Introduction to Data Structures and Algorithms

Birkha..., 2001
Tapa dura

Los mejores resultados en AbeBooks

1.

J.A. Storer
Publicado por Springer-Verlag New York Inc., United States (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Paperback Cantidad disponible: 10
Librería
Book Depository hard to find
(London, Reino Unido)
Valoración
[?]

Descripción Springer-Verlag New York Inc., United States, 2012. Paperback. Condición: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. 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, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the clutter of the syntax of a particular programming language; algorithms are presented with self-explanatory pseudo-code. * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates 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 algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not 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 by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002. Nº de ref. del artículo: LIE9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 82,72
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

2.

J.A. Storer
Publicado por Springer-Verlag New York Inc., United States (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Paperback Cantidad disponible: 10
Impresión bajo demanda
Librería
The Book Depository
(London, Reino Unido)
Valoración
[?]

Descripción Springer-Verlag New York Inc., United States, 2012. Paperback. Condición: New. Language: English . Brand New Book ***** Print on Demand *****.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, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the clutter of the syntax of a particular programming language; algorithms are presented with self-explanatory pseudo-code. * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates 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 algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not 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 by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002. Nº de ref. del artículo: AAV9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 85,61
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

3.

J.A. STORER
Publicado por Birkhäuser (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Paperback Cantidad disponible: 1
Librería
Herb Tandree Philosophy Books
(Stroud, GLOS, Reino Unido)
Valoración
[?]

Descripción Birkhäuser, 2012. Paperback. Condición: NEW. 9781461266013 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Nº de ref. del artículo: HTANDREE0406533

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 78,42
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 8,93
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

4.

Storer, J. a.
Publicado por Birkhäuser (2016)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Paperback Cantidad disponible: 1
Impresión bajo demanda
Librería
Ria Christie Collections
(Uxbridge, Reino Unido)
Valoración
[?]

Descripción Birkhäuser, 2016. Paperback. Condición: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Nº de ref. del artículo: ria9781461266013_lsuk

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 83,80
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 4,32
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

5.

J.A. Storer
Publicado por Springer-Verlag New York Inc., United States (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Paperback Cantidad disponible: 10
Impresión bajo demanda
Librería
Book Depository International
(London, Reino Unido)
Valoración
[?]

Descripción Springer-Verlag New York Inc., United States, 2012. Paperback. Condición: New. Language: English . Brand New Book ***** Print on Demand *****. 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, Induction and Recursion, Trees, Algorithm Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Graphs, Strings, Discrete Fourier Transform, Parallel Computation. Key features: Complicated concepts are expressed clearly in a single page with minimal notation and without the clutter of the syntax of a particular programming language; algorithms are presented with self-explanatory pseudo-code. * Chapters 1-4 focus on elementary concepts, the exposition unfolding at a slower pace. Sample exercises with solutions are provided. Sections that may be skipped for an introductory course are starred. Requires only some basic mathematics background and some computer programming experience. * Chapters 5-13 progress at a faster pace. The material is suitable for undergraduates 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 algorithm design, hashing, and graph algorithms) and for a one-semester advanced course that starts at Chapter 5. A year-long course may be based on the entire book. * Sorting, often perceived as rather technical, is not 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 by comparisons are included with the presentation of heaps in the context of lower bounds for comparison-based structures. * Chapter 13 on parallel models of computation is something of a mini-book itself, and a good way to end a course. Although it is not clear what parallel Softcover reprint of the original 1st ed. 2002. Nº de ref. del artículo: AAV9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 89,14
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

6.

John C. Cherniavsky
Publicado por Springer-Verlag New York Inc. (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Cantidad disponible: > 20
Impresión bajo demanda
Librería
Books2Anywhere
(Fairford, GLOS, Reino Unido)
Valoración
[?]

Descripción Springer-Verlag New York Inc., 2012. PAP. Condición: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: LQ-9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 79,51
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,08
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío

7.

J.A. Storer
Publicado por Birkhäuser (2013)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Tapa blanda Cantidad disponible: 15
Impresión bajo demanda
Librería
Valoración
[?]

Descripción Birkhäuser, 2013. Condición: New. This item is printed on demand for shipment within 3 working days. Nº de ref. del artículo: LP9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 87,59
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 2,75
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío

8.

John C. Cherniavsky
Publicado por Springer-Verlag New York Inc. (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Cantidad disponible: > 20
Impresión bajo demanda
Librería
Pbshop
(Wood Dale, IL, Estados Unidos de America)
Valoración
[?]

Descripción Springer-Verlag New York Inc., 2012. PAP. Condición: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Nº de ref. del artículo: IQ-9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 89,42
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 3,40
A Estados Unidos de America
Destinos, gastos y plazos de envío

9.

Storer, J.A.
Publicado por Birkhäuser
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo PAPERBACK Cantidad disponible: > 20
Librería
Russell Books
(Victoria, BC, Canada)
Valoración
[?]

Descripción Birkhäuser. PAPERBACK. Condición: New. 1461266017 Special order direct from the distributor. Nº de ref. del artículo: ING9781461266013

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 117,24
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 5,96
De Canada a Estados Unidos de America
Destinos, gastos y plazos de envío

10.

J.A. Storer
Publicado por Birkhäuser (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevo Tapa blanda Cantidad disponible: 1
Librería
Irish Booksellers
(Portland, ME, Estados Unidos de America)
Valoración
[?]

Descripción Birkhäuser, 2012. Condición: New. book. Nº de ref. del artículo: M1461266017

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 124,11
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
A Estados Unidos de America
Destinos, gastos y plazos de envío

Existen otras copia(s) de este libro

Ver todos los resultados de su búsqueda