MOMENTAN AUSVERKAUFT
Über dieses Produkt
Product Identifiers
PublisherMIT Press
ISBN-100262036630
ISBN-139780262036634
eBay Product ID (ePID)237369071
Product Key Features
Number of Pages336 Pages
Publication NameOnce Upon an Algorithm : How Stories Explain Computing
LanguageEnglish
SubjectProgramming / Algorithms, Computer Science, Popular Culture
Publication Year2017
TypeTextbook
AuthorMartin Erwig
Subject AreaComputers, Social Science
FormatHardcover
Dimensions
Item Height0.9 in
Item Weight20.2 Oz
Item Length9.3 in
Item Width7.4 in
Additional Product Features
Intended AudienceTrade
LCCN2016-053945
Dewey Edition23
Reviews...a thoughtful and approachable guide to the fundamentals of how computer science exists as an intellectual discipline.-- Times Higher Education --, ...a thoughtful and approachable guide to the fundamentals of how computer science exists as an intellectual discipline.
IllustratedYes
Dewey Decimal005.1
SynopsisThis easy-to-follow introduction to computer science reveals how familiar stories like Hansel and Gretel, Sherlock Holmes, and Harry Potter illustrate the concepts and everyday relevance of computing. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm , Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example- You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning., How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day , Harry Potter, and other familiar stories illustrate the concepts of computing. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm , Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.
LC Classification NumberQA76.9.A43E78 2017
Bewertungen und Rezensionen
Relevanteste Rezensionen
- 24. Mai. 2021
I am buying a second one for a relative
Well written starting soft and easy moving to the harder details towards the end using stories to explain what is happening with a computer in a really simple way.Bestätigter Kauf: JaArtikelzustand: Gebraucht
