Once upon an algorithm : (Record no. 265187)

MARC details
000 -LEADER
fixed length control field 03204cam a2200325 i 4500
001 - CONTROL NUMBER
control field ocn965754167
003 - CONTROL NUMBER IDENTIFIER
control field OCoLC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20180722225606.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 161128s2017 maua b 001 0 eng
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER
LC control number 2016053945
040 ## - CATALOGING SOURCE
Original cataloging agency DLC
Language of cataloging eng
Description conventions rda
Transcribing agency DLC
Modifying agency OCLCF
-- BDX
-- OCLCQ
-- BTCTA
-- YDX
-- YDX
-- SOI
-- GUA
-- NFG
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780262036634
Qualifying information hardcover ;
-- alkaline paper
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0262036630
Qualifying information hardcover ;
-- alkaline paper
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)965754167
042 ## - AUTHENTICATION CODE
Authentication code pcc
092 ## - LOCALLY ASSIGNED DEWEY CALL NUMBER (OCLC)
Classification number 005.1
Item number E73
049 ## - LOCAL HOLDINGS (OCLC)
Holding library NFGA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Erwig, Martin,
Relator term author.
9 (RLIN) 347656
245 10 - TITLE STATEMENT
Title Once upon an algorithm :
Remainder of title how stories explain computing /
Statement of responsibility, etc Martin Erwig.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE STATEMENTS
Place of production, publication, distribution, manufacture Cambridge, Massachusetts :
Name of producer, publisher, distributor, manufacturer The MIT Press,
Date of production, publication, distribution, manufacture [2017]
300 ## - PHYSICAL DESCRIPTION
Extent xii, 319 pages :
Other physical details illustrations ;
Dimensions 24 cm
336 ## - CONTENT TYPE
Content Type Term text
Content Type Code txt
Source rdacontent
337 ## - MEDIA TYPE
Media Type Term unmediated
Media Type Code n
Source rdamedia
338 ## - CARRIER TYPE
Carrier Type Term volume
Carrier Type Code nc
Source rdacarrier
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references (pages 303-311) and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note A path to understanding computation -- Walk the walk : when computation really happens -- The mystery of signs -- Detective's notebook : accessory after the fact -- The search for the perfect data structure -- Sorting out sorting -- Mission intractable -- The prism of language -- Finding the right tone : sound meaning -- Weather, rinse, repeat -- Happy ending not guaranteed -- A stitch in time computes fine -- A matter of interpretation -- The magical type -- A bird's eye view : abstracting from details.
520 ## - SUMMARY, ETC.
Summary, etc "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" -- From the publisher.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer algorithms
Form subdivision Popular works.
9 (RLIN) 347657
994 ## -
-- C0
-- NFG
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Current library Date acquired Total Checkouts Total Renewals Full call number Barcode Date last seen Date checked out Cost, replacement price Price effective from Koha item type
        NonFiction Main Library Main Library 12/01/2017 6 6 005.1 E73 33111008849743 06/17/2024 01/07/2024 27.95 12/01/2017 Adult Book

Powered by Koha