MARC details
000 -LEADER |
fixed length control field |
02603nam a22002417a 4500 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
240125s2022 |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780262545297 |
022 ## - INTERNATIONAL STANDARD SERIAL NUMBER |
ISSN-L |
9780262545297 |
041 ## - LANGUAGE CODE |
Language code of text/sound track or separate title |
English |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.1 |
Item number |
ERW |
100 ## - MAIN ENTRY--PERSONAL NAME |
Personal name |
Erwig, Martin |
9 (RLIN) |
879331 |
Relator term |
author |
245 ## - TITLE STATEMENT |
Title |
Once Upon an Algorithm How Stories Explain Computing |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Cambridge, MA : |
Name of publisher, distributor, etc. |
MIT Press, |
Date of publication, distribution, etc. |
2022 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xii, 319 p. |
Other physical details |
: ill |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc. note |
Includes Bibliographical References and Index |
520 ## - SUMMARY, ETC. |
Summary, etc. |
SUMMARY<br/><br/>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.<br/><br/>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.<br/> <br/>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.<br/> <br/>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.<br/> |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
9 (RLIN) |
295004 |
Topical term or geographic name entry element |
Algorithms |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
9 (RLIN) |
880344 |
Topical term or geographic name entry element |
Computer Algorithms Popular Works |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
9 (RLIN) |
880345 |
Topical term or geographic name entry element |
Nonfiction |
856 ## - ELECTRONIC LOCATION AND ACCESS |
Link text |
TOC |
Uniform Resource Identifier |
<a href="https://eaklibrary.neduet.edu.pk:8443/catalog/bk/books/toc/9780262545297.pdf">https://eaklibrary.neduet.edu.pk:8443/catalog/bk/books/toc/9780262545297.pdf</a> |
856 ## - ELECTRONIC LOCATION AND ACCESS |
Link text |
WEB LINK |
Uniform Resource Identifier |
<a href="https://mitpress.mit.edu/9780262545297/once-upon-an-algorithm/">https://mitpress.mit.edu/9780262545297/once-upon-an-algorithm/</a> |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Book |