Recently Viewed

New

An Introduction to Data Structures and Algorithms by John C. Cherniavsky 9780817642532

No reviews yet Write a Review
Booksplease Price: £45.97

  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When you buy 3 or more books on Booksplease - Use code: FREEUKDELIVERY in your cart!

SKU:
9780817642532
Available from Booksplease!
Availability: Usually dispatched within 4 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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

Book Information
ISBN 9780817642532
Author John C. Cherniavsky
Format Hardback
Page Count 599
Imprint Birkhauser Boston Inc
Publisher Birkhauser Boston Inc
Weight(grams) 1310g

Reviews

No reviews yet Write a Review

Booksplease  Reviews


J - United Kingdom

Fast and efficient way to choose and receive books

This is my second experience using Booksplease. Both orders dealt with very quickly and despatched. Now waiting for my next read to drop through the letterbox.

J - United Kingdom

T - United States

Will definitely use again!

Great experience and I have zero concerns. They communicated through the shipping process and if there was any hiccups in it, they let me know. Books arrived in perfect condition as well as being fairly priced. 10/10 recommend. I will definitely shop here again!

T - United States

R - Spain

The shipping was just superior

The shipping was just superior; not even one of the books was in contact with the shipping box -anywhere-, not even a corner or the bottom, so all the books arrived in perfect condition. The international shipping took around 2 weeks, so pretty great too.

R - Spain

J - United Kingdom

Found a hard to get book…

Finding a hard to get book on Booksplease and with it not being an over inflated price was great. Ordering was really easy with updates on despatch. The book was packaged well and in great condition. I will certainly use them again.

J - United Kingdom