Once Upon an Algorithm by Martin Erwig at Bookstore UAE
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Science: general issues > Popular science > Once Upon an Algorithm: How Stories Explain Computing 
Once Upon an Algorithm: How Stories Explain Computing 

Once Upon an Algorithm: How Stories Explain Computing 


     0     
5
4
3
2
1



Available


X
About the Book

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.

Table of Contents:
Preface vii Acknowledgments xi Introduction 1 Part I Algorithms Computation and Algorithms -- Hansel and Gretel 1 A Path to Understanding Computation 19 2 Walk the Walk: When Computation Really Happens 33 Representation and Data Structures -- Sherlock Holmes 3 The Mystery of Signs 49 4 Detective's Notebook: Accessory after the Fact 63 Problem Solving and Its Limitations -- Indiana Jones 5 The Search for the Perfect Data Structure 83 6 Sorting out Sorting 103 7 Mission Intractable 121 Part II Languages Language and Meaning -- Over the Rainbow 8 The Prism of Language 141 9 Finding the Right Tone: Sound Meaning 159 Control Structures and Loops -- Groundhog Day 10 Weather, Rinse, Repeat 175 11 Happy Ending Not Guaranteed 189 Recursion -- Back to the Future 12 A Stitch in Time Computes Fine 205 13 A Matter of Interpretation 225 Types and Abstraction -- Harry Potter 14 The Magical Type 245 15 A Bird's Eye View: Abstracting from Details 263 Glossary 287 Notes 303 Index 313

About the Author :
Martin Erwig is Professor of Computer Science in the School of Electrical Engineering and Computer Science at Oregon State University.

Review :
“[A] thoughtful and approachable guide to the fundamentals of how computer science exists as an intellectual discipline.” —Times Higher Education   “[A] fun and accessible read. . . . Once Upon an Algorithm is recommended to anyone new to the field of computer science with an interest in learning about the theoretical basics of the field as well as its application to our lives.” —LSE Review of Books   “This brilliant book not only makes computing and informational thinking more accessible, but it also shows the undeniable relevance of those domains to daily life.” —Digicult


Best Sellers


Product Details
  • ISBN-13: 9780262545297
  • Publisher: MIT Press Ltd
  • Publisher Imprint: MIT Press
  • Height: 229 mm
  • No of Pages: 332
  • Sub Title: How Stories Explain Computing 
  • ISBN-10: 0262545292
  • Publisher Date: 09 Aug 2022
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Width: 178 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Once Upon an Algorithm: How Stories Explain Computing 
MIT Press Ltd -
Once Upon an Algorithm: How Stories Explain Computing 
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Once Upon an Algorithm: How Stories Explain Computing 

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!