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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Goodwill of Colorado, COLORADO SPRINGS, CO, Etats-Unis
Etat : very_good. This item shows limited signs of wear overall with minor scuffs or cosmetic blemishes. No curled corners, bent covers or damage to dust jackets. No highlighting writing in pages. Digital codes may not be included and have not been tested to be redeemable and or active. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you! N° de réf. du vendeur 466XBX001NWE
Quantité disponible : 1 disponible(s)
Vendeur : Bellwetherbooks, McKeesport, PA, Etats-Unis
paperback. Etat : Very Good. Very Good Condition - May show some limited signs of wear and may have a remainder mark. Pages and dust cover are intact and not marred by notes or highlighting. N° de réf. du vendeur MIT-PB-VG-0262545292
Quantité disponible : 2 disponible(s)
Vendeur : HPB-Diamond, Dallas, TX, Etats-Unis
paperback. Etat : Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_423784186
Quantité disponible : 1 disponible(s)
Vendeur : Half Price Books Inc., Dallas, TX, Etats-Unis
paperback. Etat : Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_446779661
Quantité disponible : 1 disponible(s)
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
Paperback. Etat : Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. N° de réf. du vendeur 0262545292-8-1
Quantité disponible : 1 disponible(s)
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
Paperback. Etat : Good. N° de réf. du vendeur mon0003680143
Quantité disponible : 1 disponible(s)
Vendeur : Magers and Quinn Booksellers, Minneapolis, MN, Etats-Unis
paperback. Etat : Very Good. May have light to moderate shelf wear and/or a remainder mark. Complete. Clean pages. N° de réf. du vendeur 1488235
Quantité disponible : 2 disponible(s)
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Paperback. Etat : Fine. N° de réf. du vendeur GOR013327300
Quantité disponible : 1 disponible(s)
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Paperback. Etat : new. Paperback. 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 Potters 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780262545297
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 44266251-n
Quantité disponible : 15 disponible(s)