0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Not currently available

Animated Algorithms - A Hypermedia Learning Environment for Introduction to Algorithms (Digital) Loot Price: R981
Discovery Miles 9 810
You Save: R238 (20%)
Animated Algorithms - A Hypermedia Learning Environment for Introduction to Algorithms (Digital): Peter A. Gloor, Scott Dynes,...

Animated Algorithms - A Hypermedia Learning Environment for Introduction to Algorithms (Digital)

Peter A. Gloor, Scott Dynes, Irene Lee

 (sign in to rate)
List price R1,219 Loot Price R981 Discovery Miles 9 810 | Repayment Terms: R92 pm x 12* You Save R238 (20%)

Bookmark and Share

Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.

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. FibonacciHeaps. Huffman Encoding. Dynamic Programming. Matrix Multiplication. Matrix Inverse. Convex Hull. Genetic Algorithms. Neural Networks.

General

Imprint: MIT Press
Country of origin: United States
Release date: October 1993
First published: August 1993
Authors: Peter A. Gloor • Scott Dynes • Irene Lee
Dimensions: 124 x 142 x 10mm (L x W x T)
Format: Digital
Pages: 250
ISBN-13: 978-0-262-57096-1
Categories: Books > Computing & IT > Computer programming > General
Books > Computing & IT > Computer software packages > Multimedia
Promotions
LSN: 0-262-57096-3
Barcode: 9780262570961

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners