Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Once upon an algorithm : how stories explain computing
Erwig M., The MIT Press, Cambridge, MA, 2017. 336 pp. Type: Book (978-0-262036-63-4)
Date Reviewed: Sep 21 2018

Martin Erwig emphasizes the general nature of computation and the use of computer science (CS) in this book. He uses well-known stories to explain computing concepts to readers not familiar with the field.

The book’s two parts cover several topics that are then illustrated by famous stories. Part 1, “Algorithms,” includes “Computation and Algorithms” (chapters 1 and 2), “Representation and Data Structures” (chapters 3 and 4), and “Problem Solving and Its Limitations” (chapters 5, 6, and 7). Each of the three topics represents basic ideas in CS. Erwig uses Hansel and Gretel to illustrate “Computation and Algorithm,” Sherlock Holmes to illustrate “Representation and Data Structures,” and Indiana Jones to illustrate “Problem Solving and Its Limitations.”

Part 2, “Languages,” describes “Language and Meaning” (chapters 8 and 9), “Control Structures and Loops” (chapters 10 and 11), “Recursion” (chapters 12 and 13), and “Types and Abstraction” (chapters 14 and 15). The respective stories used are “Over the Rainbow,” Groundhog Day, Back to the Future, and Harry Potter.

The book makes a strong effort to introduce readers to the concepts; however, overall, the applied stories seem out of place. Hansel and Gretel, for example, is used to explain how we can understand computation and when computation really happens. While the story illustrates simple ideas, will it motivate readers to learn about computation? Surely many children enjoy fairy tales, but it is not clear that readers curious about computation would use Hansel and Gretel to learn about it. Similarly, other stories used in this book seem simplistic, and it is questionable whether even high school or undergraduate students would be interested in the connections between the presented stories and the important CS tools. Unfortunately, the book misses its chance to generate new interest in this topic.

More reviews about this item: Amazon, Goodreads

Reviewer:  Burkhard Englert Review #: CR146248 (1812-0617)
Bookmark and Share
  Featured Reviewer  
 
General (F.2.0 )
 
 
General (D.1.0 )
 
 
Introductory And Survey (A.1 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Algorithms in C
Sedgewick R., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990. Type: Book (9780201514254)
Sep 1 1991
Algorithms from P to NP (vol. 1)
Moret B., Shapiro H. (ed), Benjamin-Cummings Publ. Co., Inc., Redwood City, CA, 1991. Type: Book (9780805380088)
May 1 1992
The design and analysis of algorithms
Kozen D. (ed), Springer-Verlag New York, Inc., New York, NY, 1992. Type: Book (9780387976877)
Sep 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy