LEADER 02265nam  2200505Ia 450 
001 9910741193303321
005 20200520144314.0
010   $a1-4471-5019-8
024 7 $a10.1007/978-1-4471-5019-0
035   $a(OCoLC)840486687
035   $a(MiFhGG)GVRL6WQJ
035   $a(CKB)2550000001044172
035   $a(MiAaPQ)EBC1205272
035   $a(EXLCZ)992550000001044172
100   $a20130206d2013      uy         0
101 0 $aeng
135   $aurun|---uuuua
181   $ctxt
182   $cc
183   $acr
200 10$aExplaining algorithms using metaphors /$fMichal Forisek, Monika Steinova
205   $a1st ed. 2013.
210   $aNew York $cSpringer$d2013
215   $a1 online resource (x, 94 pages) $cillustrations
225 1 $aSpringerBriefs in Computer Science,$x2191-5768
300   $a"ISSN: 2191-5768."
311   $a1-4471-5018-X 
320   $aIncludes bibliographical references and index.
327   $aIntroduction -- Graph Algorithms -- Computational Geometry -- Strings and Sequences -- Solutions to Exercises.
330   $aThere 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.
410  0$aSpringerBriefs in computer science.
606   $aAlgorithms$xStudy and teaching
606   $aAlgorithms
615  0$aAlgorithms$xStudy and teaching.
615  0$aAlgorithms.
676   $a374.26
700   $aForisek$b Michal$01424094
701   $aSteinova$b Monika$01761248
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910741193303321
996   $aExplaining algorithms using metaphors$94200574
997   $aUNINA