Explaining Algorithms Using Metaphors: SpringerBriefs in Computer Science
Autor Michal Forišek, Monika Steinováen Limba Engleză Paperback – 20 apr 2013
Din seria SpringerBriefs in Computer Science
- 20% Preț: 120.62 lei
- Preț: 433.76 lei
- Preț: 462.24 lei
- Preț: 292.48 lei
- 20% Preț: 166.96 lei
- 20% Preț: 316.35 lei
- 20% Preț: 287.76 lei
- 20% Preț: 335.65 lei
- 20% Preț: 395.28 lei
- 20% Preț: 313.80 lei
- 20% Preț: 313.80 lei
- 20% Preț: 313.64 lei
- 20% Preț: 313.17 lei
- 20% Preț: 312.67 lei
- Preț: 364.77 lei
- 20% Preț: 225.96 lei
- 20% Preț: 314.94 lei
- 20% Preț: 313.80 lei
- 20% Preț: 312.99 lei
- 20% Preț: 313.30 lei
- 20% Preț: 314.13 lei
- 20% Preț: 314.94 lei
- 20% Preț: 314.27 lei
- 20% Preț: 312.99 lei
- 20% Preț: 312.85 lei
- 20% Preț: 314.27 lei
- Preț: 363.45 lei
- Preț: 341.49 lei
- 20% Preț: 315.26 lei
- Preț: 334.69 lei
- Preț: 366.08 lei
- Preț: 366.46 lei
- 20% Preț: 314.94 lei
- 20% Preț: 342.22 lei
- 20% Preț: 312.19 lei
- 20% Preț: 312.99 lei
- 20% Preț: 314.94 lei
- 20% Preț: 312.85 lei
- Preț: 363.81 lei
- 20% Preț: 311.08 lei
- 20% Preț: 314.13 lei
- 20% Preț: 314.94 lei
- 20% Preț: 225.15 lei
- 20% Preț: 294.95 lei
- 20% Preț: 313.30 lei
- 20% Preț: 312.36 lei
- 20% Preț: 314.13 lei
- 20% Preț: 313.80 lei
- 20% Preț: 314.58 lei
- 20% Preț: 314.58 lei
Preț: 415.41 lei
Nou
Puncte Express: 623
Preț estimativ în valută:
79.50€ • 83.37$ • 66.29£
79.50€ • 83.37$ • 66.29£
Carte tipărită la comandă
Livrare economică 03-09 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781447150183
ISBN-10: 144715018X
Pagini: 106
Ilustrații: X, 94 p. 59 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.16 kg
Ediția:2013
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science
Locul publicării:London, United Kingdom
ISBN-10: 144715018X
Pagini: 106
Ilustrații: X, 94 p. 59 illus.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.16 kg
Ediția:2013
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
Introduction.- Graph Algorithms.- Computational Geometry.- Strings and Sequences.- Solutions to Exercises.
Recenzii
From the reviews:
“This booklet is divided into four chapters, making it easy to follow the basic semiotics of the symbols used in the algorithms. … The book concludes with an appendix containing the solutions to the exercises in the chapters. … Anyone interested in teaching algorithms should read this valuable booklet. It includes appropriate text structure, easy-to-follow examples, discussions, and proposals, and could be of use to computer programming teachers and computer programmers looking to improve their programming skills.” (F. J. Ruzic, Computing Reviews, August, 2013)
“This booklet is divided into four chapters, making it easy to follow the basic semiotics of the symbols used in the algorithms. … The book concludes with an appendix containing the solutions to the exercises in the chapters. … Anyone interested in teaching algorithms should read this valuable booklet. It includes appropriate text structure, easy-to-follow examples, discussions, and proposals, and could be of use to computer programming teachers and computer programmers looking to improve their programming skills.” (F. J. Ruzic, Computing Reviews, August, 2013)
Textul de pe ultima copertă
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.
Caracteristici
Reviews the state of the art in teaching algorithms and classic metaphors in computer science Introduces new, inventive ways of teaching algorithms Presents the results within the broader context of computer science education and popularization