//]]>
Normal View MARC View ISBD View

Explaining Algorithms Using Metaphors

by Forišek, Michal.
Authors: Steinová, Monika.%author. | SpringerLink (Online service) Series: SpringerBriefs in Computer Science, 2191-5768 Physical details: X, 94 p. 59 illus. online resource. ISBN: 1447150198 Subject(s): Computer science. | Education. | Science %Study and teaching. | Computer Science. | Computers and Education. | Science Education.
Tags from this library:
No tags from this library for this title.
Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 374.26 (Browse Shelf) Not for loan

Introduction -- Graph Algorithms -- Computational Geometry -- Strings and Sequences -- Solutions to Exercises.

There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the "classic textbook" algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes for teachers based on the authors’ experiences when using the metaphor in a classroom setting.

There are no comments for this item.

Log in to your account to post a comment.

Languages: 
English |
العربية