Animated Algorithms: A Hypermedia Learning Environment for Introduction to Algorithms,Used

Animated Algorithms: A Hypermedia Learning Environment for Introduction to Algorithms,Used

In Stock
SKU: SONG0262570963
Brand: MIT Press (MA)
$28.96
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

This hypermedia CDROM 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, fulltext 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 online help, making them selfcontained. 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. RedBlack Trees. Minimum Spanning Trees. SingleSource Shortest Paths. Fibonacci Heaps. Huffman Encoding. Dynamic Programming. Matrix Multiplication. Matrix Inverse. Convex Hull. Genetic Algorithms. Neural Networks.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed