Once upon an algorithm : (Record no. 73513)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01997nam a2200505 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 8029869 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220712204911.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 171107s2017 mau ob 001 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262341691 |
| -- | electronic bk. |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | electronic bk. |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | electronic bk. |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | electronic bk. |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.1 |
| 100 1# - AUTHOR NAME | |
| Author | Erwig, Martin, |
| 245 10 - TITLE STATEMENT | |
| Title | Once upon an algorithm : |
| Sub Title | how stories explain computing / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 PDF (336 pages). |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing. |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=8029869 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cambridge, Massachusetts : |
| -- | MIT Press, |
| -- | [2017] |
| 264 #2 - | |
| -- | [Piscataqay, New Jersey] : |
| -- | IEEE Xplore, |
| -- | [2017] |
| 336 ## - | |
| -- | text |
| -- | rdacontent |
| 337 ## - | |
| -- | electronic |
| -- | isbdmedia |
| 338 ## - | |
| -- | online resource |
| -- | rdacarrier |
| 588 ## - | |
| -- | Online resource; title from PDF title page (EBSCO, viewed August 29, 2017) |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer algorithms |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer algorithms. |
No items available.