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

4.5 avg rating
( 2 ratings by Goodreads )
 
9780817642532: An Introduction to Data Structures and Algorithms (Progress in Computer Science and Applied Logic)
View all copies of this ISBN edition:
 
 

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

"synopsis" may belong to another edition of this title.

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

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

9781461266013: An Introduction to Data Structures and Algorithms

Featured Edition

ISBN 10:  1461266017 ISBN 13:  9781461266013
Publisher: Springer, 2012
Softcover

9788184890815: An Introduction to Data Structures and Algorithms

SPRING..., 2009
Softcover

9783764342531: Introduction to Data Structures and Algorithms

Birkha...
Hardcover

Top Search Results from the AbeBooks Marketplace

International Edition
International Edition

1.

Storer, J.A.
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Paperback Quantity Available: 1
International Edition
Seller:
Bookstore99
(Wilmington, DE, U.S.A.)

Book Description Paperback. Condition: NEW. International Edition, Paperback, Brand New, ISBN and Cover image may differ but contents similar to U.S. Edition, Printed in Black & White. End Chapter Exercises may differ. No CD/Access code. Legal to use despite any disclaimer, We ship to PO , APO and FPO adresses in U.S.A .Choose Expedited Shipping for FASTER DELIVERY.Customer Satisfaction Guaranteed. Seller Inventory # US_9788184890815

More information about this seller | Contact this seller

Buy New
US$ 18.51
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

2.

J.A. Storer
Published by BIRKHAUSER BOSTON INC, United States (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Hardcover Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)

Book Description BIRKHAUSER BOSTON INC, United States, 2001. Hardback. Condition: New. 2002 ed. Language: English. 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. Seller Inventory # LHB9780817642532

More information about this seller | Contact this seller

Buy New
US$ 88.04
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

3.

Cherniavsky, John C.
Published by Birkhäuser (2017)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Paperback Quantity Available: 10
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)

Book Description Birkhäuser, 2017. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2017; Fast Shipping from the UK. No. book. Seller Inventory # ria9780817642532_lsuk

More information about this seller | Contact this seller

Buy New
US$ 99.29
Convert currency

Add to Basket

Shipping: US$ 3.72
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

Storer, J.A.
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Quantity Available: 1
Seller:
BennettBooksLtd
(San Diego, CA, U.S.A.)

Book Description Condition: New. New. Seller Inventory # S-0817642536

More information about this seller | Contact this seller

Buy New
US$ 101.41
Convert currency

Add to Basket

Shipping: US$ 4.95
Within U.S.A.
Destination, rates & speeds

5.

John C. Cherniavsky
Published by Birkh?user (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Quantity Available: > 20
Print on Demand
Seller:
Paperbackshop-US
(Wood Dale, IL, U.S.A.)

Book Description Birkh?user, 2001. HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780817642532

More information about this seller | Contact this seller

Buy New
US$ 111.42
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

6.

J.A. Storer
Published by BIRKHAUSER BOSTON INC, United States (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Hardcover Quantity Available: 10
Seller:
Book Depository International
(London, United Kingdom)

Book Description BIRKHAUSER BOSTON INC, United States, 2001. Hardback. Condition: New. 2002 ed. Language: English. 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. Seller Inventory # APC9780817642532

More information about this seller | Contact this seller

Buy New
US$ 121.60
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

7.

J.A. Storer, John C. Cherniavsky (Editor)
Published by Birkhäuser (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)

Book Description Birkhäuser, 2001. Hardcover. Condition: New. 2002. Seller Inventory # DADAX0817642536

More information about this seller | Contact this seller

Buy New
US$ 121.85
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

8.

J.A. Storer
Published by BIRKHAUSER BOSTON INC, United States (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Hardcover Quantity Available: 10
Seller:
The Book Depository
(London, United Kingdom)

Book Description BIRKHAUSER BOSTON INC, United States, 2001. Hardback. Condition: New. 2002 ed. Language: English. 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. Seller Inventory # APC9780817642532

More information about this seller | Contact this seller

Buy New
US$ 131.26
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Storer, J.A.
Published by Birkhäuser (2001)
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Hardcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)

Book Description Birkhäuser, 2001. Condition: New. book. Seller Inventory # M0817642536

More information about this seller | Contact this seller

Buy New
US$ 128.70
Convert currency

Add to Basket

Shipping: US$ 4.78
Within U.S.A.
Destination, rates & speeds

10.

Storer, J.A.
Published by SPRINGER
ISBN 10: 0817642536 ISBN 13: 9780817642532
New Quantity Available: 3
Seller:
BookVistas
(New Delhi, India)

Book Description SPRINGER. Condition: New. Seller Inventory # SR-ECO-9780817642532

More information about this seller | Contact this seller

Buy New
US$ 129.55
Convert currency

Add to Basket

Shipping: US$ 7.24
From India to U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book