An Introduction to Data Structures and Algorithms

4,5 valoración promedio
( 2 valoraciones por Goodreads )
 
9781461266013: An Introduction to Data Structures and Algorithms

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

"Sinopsis" puede pertenecer a otra edición de este libro.

About the Author:

James A. Storer received his B.A. in Mathematics and Computer Science from Cornell University, his M.A. in Computer Science from Princeton University, and his Ph.D. in Computer Science from Princeton University. After leaving Princeton he was a researcher at Bell Laboratories in Murray Hill, New Jersey. He then came to Brandeis University, where he is currently Chair of the Computer Science Department and member of the Brandeis Center for Complex Systems.

Review:

"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

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

Los mejores resultados en AbeBooks

Edición internacional
Edición internacional

1.

Storer James A.
Editorial: Springer India
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Cantidad: 5
Edición internacional
Librería
TEXTBOOKSZONE
(NEW DELHI, India)
Valoración
[?]

Descripción Springer India. Estado de conservación: Brand New. This is Brand New International Edition, Paperback, Different ISBN with same content, Excellent Quality & Shrink Wrap. English language. Perfect condition. Please contact us for any questions regarding this book.!!. Nº de ref. de la librería TBZ-2433

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 24,40
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De India a Estados Unidos de America
Destinos, gastos y plazos de envío
Edición internacional
Edición internacional

2.

Storer James A.
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Cantidad: 2
Edición internacional
Librería
University Bookstore
(DELHI, DELHI, India)
Valoración
[?]

Descripción Estado de conservación: New. This book is Brand NEW Soft cover International edition . ISBN number and cover page may be different but contents identical to the US edition with Black & White printing. Restricted Sales Disclaimer Wordings Not For Sales In USA And Canada May Be Printed On The Cover Of The Book. Book is in English language. Nº de ref. de la librería Adhya-19082017-946

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 14,78
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,00
De India a Estados Unidos de America
Destinos, gastos y plazos de envío
Edición internacional
Edición internacional

3.

Storer James A.
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Cantidad: 2
Edición internacional
Librería
University Bookstore
(DELHI, DELHI, India)
Valoración
[?]

Descripción Estado de conservación: New. This book is Brand NEW Soft cover International edition . ISBN number and cover page may be different but contents identical to the US edition with Black & White printing. Restricted Sales Disclaimer Wordings Not For Sales In USA And Canada May Be Printed On The Cover Of The Book. Book is in English language. Nº de ref. de la librería Adhya-29072017-1088

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 15,77
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,00
De India a Estados Unidos de America
Destinos, gastos y plazos de envío
Edición internacional
Edición internacional

4.

STORER JAMES A.
Editorial: Springer Nature (SIE)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Cantidad: 4
Edición internacional
Librería
TEXTBOOKSZONE
(NEW DELHI, India)
Valoración
[?]

Descripción Springer Nature (SIE). Estado de conservación: Brand New. This is Brand New, INTERNATIONAL Edition, Paperback, Different ISBN & same front cover, same contents, Excellent Quality with Shrink Wrap, English language, Perfect condition. Please contact us for any questions regarding this book.!!. Nº de ref. de la librería TBZS-450

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 31,85
Convertir moneda

Añadir al carrito

Gastos de envío: GRATIS
De India a Estados Unidos de America
Destinos, gastos y plazos de envío
Edición internacional
Edición internacional

5.

STORER JAMES A.
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Cantidad: 2
Edición internacional
Librería
University Bookstore
(DELHI, DELHI, India)
Valoración
[?]

Descripción Estado de conservación: New. This book is Brand NEW Soft cover International edition . ISBN number may be different but contents and cover photo identical to the US edition with Black & White printing. Restricted Sales Disclaimer Wordings Not For Sales In USA And Canada May Be Printed On The Cover Of The Book. Book is in English language. Nº de ref. de la librería Star-29072017-3697

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 22,78
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 10,00
De India a Estados Unidos de America
Destinos, gastos y plazos de envío

6.

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

Descripción Springer-Verlag New York Inc., United States, 2012. Paperback. Estado de conservació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. de la librería LIE9781461266013

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 78,98
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

7.

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

Descripción Springer-Verlag New York Inc., United States, 2012. Paperback. Estado de conservació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. de la librería AAV9781461266013

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 83,16
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

8.

J.A. Storer
Editorial: Springer-Verlag New York Inc., United States (2012)
ISBN 10: 1461266017 ISBN 13: 9781461266013
Nuevos Paperback Cantidad: 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. Estado de conservació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. de la librería AAV9781461266013

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 83,17
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

9.

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

Descripción Birkhäuser, 2013. Estado de conservación: New. This item is printed on demand for shipment within 3 working days. Nº de ref. de la librería LP9781461266013

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 82,34
Convertir moneda

Añadir al carrito

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

10.

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

Descripción Birkhäuser, 2012. Paperback. Estado de conservación: NEW. 9781461266013 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Nº de ref. de la librería HTANDREE0406533

Más información sobre esta librería | Hacer una pregunta a la librería

Comprar nuevo
EUR 76,69
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 8,76
De Reino Unido 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