RC Home | Contact Us
DA-IICT Logo

Resource Centre

Algorithms unplugged (Record no. 22692)

MARC details
000 -LEADER
fixed length control field 00513nam a2200181Ia 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 161214s9999 xx 000 0 und d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783642153273
Terms of availability (hbk)
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Item number VOC
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Vocking, Berthold
245 #0 - TITLE STATEMENT
Title Algorithms unplugged
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Heidelberg:
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2011
300 ## - PHYSICAL DESCRIPTION
Extent x, 406 p.;
Other physical details ill.
Dimensions 24 cm.
520 ## - SUMMARY, ETC.
Summary, etc Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas--they facilitate new applications in science, medicine, production, logistics, traffic, communication and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs -- for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity -- the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms
Topical term or geographic name as entry element Computer algorithms
Topical term or geographic name as entry element Computer science Mathematics
Topical term or geographic name as entry element Problem solving
Topical term or geographic name as entry element Topological sorting
Topical term or geographic name as entry element Dynamic programming
Topical term or geographic name as entry element Online algorithms
Topical term or geographic name as entry element Simulated annealing
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Date last borrowed Koha item type
    Dewey Decimal Classification     DAU DAU 25/04/2012 International Book House; Invoice No. #035934; 27-03-2012 2748.56 1 005.1 VOC 026938 09/08/2022 28/07/2022 Books