Animated Algorithms: A Hypermedia Learning Environment for Introduction to Algorithms

Other Format (Print)
Buy New
Buy New from BN.com
$48.52
Used and New from Other Sellers
Used and New from Other Sellers
from $18.50
Usually ships in 1-2 business days
(Save 70%)
Other sellers (Other Format)
  • All (8) from $18.50   
  • New (3) from $49.09   
  • Used (5) from $18.50   

More About This Textbook

Overview

This hypermedia CD-ROM provides an ideal format for the visual explanation of complex algorithms contained in the text Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. It contains three complementary components: a hypertext version of the book itself, interactive animations of the most important algorithms, and movies explaining the use of the hypertext interface and the animations.

The hypertext, including the figures, is stored in HyperCard stacks. It contains tools for navigation, text annotation, tracking of preexisting links, full-text search, and the adding of links and paths through the document. This enables instructors and students to customize the hypertext easily for classroom and personal use.

The animations that are implemented in HyperCard are linked with the hypertext and can be controlled interactively by the user. They also include extensive on-line help, making them self-contained. Some animations include scripting facilities allowing users to program animations of specific data structures.

The movies ("talking heads" and demonstrations) provide a way to view noninteractive versions of the algorithm animations. These are stored on the CD in QuickTime format.

Peter Gloor is Research Associate in the Laboratory for Computer Science, and Scott Dynes is a Ph.D candidate in the Eaton Peabody Laboratory, both at the Massachusetts Institute of Technology. Irene Lee was formerly a graduate student at Harvard University.

Animated algorithms: Asymptotic Notation. Recursion. Simple Data Structures. Sorting Algorithms and Analysis. Hashing. Binary Trees. Red-Black Trees. Minimum Spanning Trees. Single-Source Shortest Paths. Fibonacci Heaps. Huffman Encoding. Dynamic Programming. Matrix Multiplication. Matrix Inverse. Convex Hull. Genetic Algorithms. Neural Networks.

Read More Show Less

Editorial Reviews

Booknews
Provides a Macintosh computer format for the visual explanation of complex algorithms in the text Introduction to Algorithms, by Thomas H. Cormen, et al. The CD-ROM contains a hypertext version of the book, interactive animations of some algorithms, and movies explaining the use of the hypertext interface and animations. The hypertext is stored in HyperCard stacks. A brief instruction booklet is included. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780262570961
  • Publisher: MIT Press
  • Publication date: 8/17/1993
  • Edition description: CD-ROM - Macintosh only
  • Pages: 250
  • Product dimensions: 5.54 (w) x 5.04 (h) x 0.39 (d)

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)