The Fictioning Horror Sale
 
 

Recently Viewed clear list


Powell's Q&A | September 3, 2014

Emily St. John Mandel: IMG Powell’s Q&A: Emily St. John Mandel



Describe your latest book. My new novel is called Station Eleven. It's about a traveling Shakespearean theatre company in a post-apocalyptic North... Continue »
  1. $17.47 Sale Hardcover add to wish list

    Station Eleven

    Emily St. John Mandel 9780385353304

spacer
Qualifying orders ship free.
$108.50
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Database- Design

An Introduction to Data Structures and Algorithms

by

An Introduction to Data Structures and Algorithms Cover

 

Synopses & Reviews

Publisher Comments:

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. * 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 yearlong 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 architectures will prevail in the future, the idea is to further teach fundamental concepts in the design of algorithms by exploring classic models of parallel computation, including the PRAM, generic PRAM simulation, HC/CCC/Butterfly, the mesh, and parallel hardware area-time tradeoffs (with many examples). Apart from classroom use, this book serves as a good reference on the subject of data structures and algorithms. Its page-at-a-time format makes it easy to review material that the reader has studied in the past.

Table of Contents

Preface * 1. RAM Model * 2. Lists * 3. Induction and Recursion * 4. Trees * 5. Algorithm Design * 6. Hashing * 7. Heaps * 8. Balanced Trees * 9. Sets Over a Small Universe * 10. Graphs * 11. Strings * 12. Discrete Fourier Transform (DFT) * 13. Parallel Computation * Appendix of Common Sums * Bibliography * Notation * Index

Product Details

ISBN:
9780817642532
Author:
Storer, James A.
Author:
Storer, J. a.
Author:
Cherniavsky, John C.
Publisher:
Birkhauser
Subject:
Programming - General
Subject:
Data structures (computer science)
Subject:
Database Management - General
Subject:
Computer algorithms
Subject:
Data Modeling & Design
Subject:
Programming - Algorithms
Subject:
Security
Subject:
Algorithm Analysis
Subject:
Data Structures and Algorithms
Subject:
problem complexity
Subject:
Data encryption.
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Database design
Copyright:
Edition Description:
Book
Publication Date:
20011109
Binding:
HARDCOVER
Language:
English
Illustrations:
Y
Pages:
616
Dimensions:
254 x 178 mm 1290 gr

Other books you might like

  1. Chocolate: A Bittersweet Saga of... Sale Trade Paper $7.98

Related Subjects

Arts and Entertainment » Art » Style and Design
Computers and Internet » Artificial Intelligence » General
Computers and Internet » Database » Design
Computers and Internet » Software Engineering » Algorithms
Computers and Internet » Software Engineering » Software Management
Science and Mathematics » Mathematics » Applied

An Introduction to Data Structures and Algorithms New Hardcover
0 stars - 0 reviews
$108.50 In Stock
Product details 616 pages Birkhauser Boston - English 9780817642532 Reviews:
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.