Algorithms Unlocked / (Record no. 8263)

MARC details
000 -LEADER
fixed length control field 02303nam a2200301Ia 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260803094148.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 251212s2013 xx 000 0 und dopyright opyright opyright
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 978-0-262-51880-2
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number 005.1 C81 c2013
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Cormen, Thomas H.,|eauthor
245 1# - TITLE STATEMENT
Title Algorithms Unlocked /
Statement of responsibility, etc. Thomas H. Cormen.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Cambridge, Massachusetts :
Name of publisher, distributor, etc. MIT Press,
Date of publication, distribution, etc. copyright 2013.
300 ## - PHYSICAL DESCRIPTION
Extent xiii, 222 pages : illustrations ; 23 cm.:
336 ## - CONTENT TYPE
Content type term text|2rdacontent.
337 ## - MEDIA TYPE
Media type term unmediated|2rdamedia.
338 ## - CARRIER TYPE
Carrier type term volume|2rdacarrier.
500 ## - GENERAL NOTE
General note Includes bibliographical references (pages 213-214) and index.
546 ## - LANGUAGE NOTE
Language note in English
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note "Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen--coauthor of the leading college textbook on the subject--provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time."--Back cover.
591 ## -
-- 0
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer algorithms.
943 ## - EQUIVALENCE OR CROSS-REFERENCE--COLLECTIVE TITLE [OBSOLETE] [CAN/MARC only]
-- 0
-- 0
Date of treaty signing 0
-- 1
Date of a work 0
Miscellaneous information 0
Medium 0
-- 0
-- 0
944 ## -
-- 1
-- 1
-- 0
953 ## -
-- HED5427
953 ## -
-- CollLib
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Institution code [OBSOLETE] hpayson
-- 2015-05-22 16:35:11
-- hpayson
Edition 2015-05-22 16:35:11
998 ## - LOCAL CONTROL INFORMATION (RLIN)
MyRDA biblio 8289
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Shelving location Date acquired Full call number Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     FEU - Cavite Higher Education FEU - Cavite Higher Education HED Library 12/21/2025 005.1 C81 c2013 HED5427 06/02/2026 12/21/2025 Books