Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Once Upon an Algorithm

How Stories Explain Computing
TaschenbuchKartoniert, Paperback
Englisch
The MIT Presserschienen am09.08.2022
This 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.mehr
Verfügbare Formate
TaschenbuchKartoniert, Paperback
EUR22,50
E-BookEPUBDRM AdobeE-Book
EUR25,49

Produkt

KlappentextThis 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.
Details
ISBN/GTIN978-0-262-54529-7
ProduktartTaschenbuch
EinbandartKartoniert, Paperback
Erscheinungsjahr2022
Erscheinungsdatum09.08.2022
SpracheEnglisch
MasseBreite 175 mm, Höhe 230 mm, Dicke 22 mm
Gewicht626 g
Illustrationen99 black and white illustrations
Artikel-Nr.58842460

Inhalt/Kritik

Inhaltsverzeichnis
Preface viiAcknowledgments xiIntroduction 1Part I AlgorithmsComputation and Algorithms -- Hansel and Gretel1 A Path to Understanding Computation 192 Walk the Walk: When Computation Really Happens 33Representation and Data Structures -- Sherlock Holmes3 The Mystery of Signs 494 Detective's Notebook: Accessory after the Fact 63Problem Solving and Its Limitations -- Indiana Jones 5 The Search for the Perfect Data Structure 836 Sorting out Sorting 1037 Mission Intractable 121Part II LanguagesLanguage and Meaning -- Over the Rainbow8 The Prism of Language 1419 Finding the Right Tone: Sound Meaning 159Control Structures and Loops -- Groundhog Day 10 Weather, Rinse, Repeat 17511 Happy Ending Not Guaranteed 189Recursion -- Back to the Future 12 A Stitch in Time Computes Fine 20513 A Matter of Interpretation 225Types and Abstraction -- Harry Potter14 The Magical Type 24515 A Bird's Eye View: Abstracting from Details 263Glossary 287Notes 303Index 313mehr