000			03113nam a2200469 i 4500
001			6482302
003			IEEE
005			20220712204808.0
006			m o d
007			cr |n|||||||||
008			151223s2013 maua ob 001 eng d
020			_a9780262313223 _qelectronic
020			_z0262313227 _qelectronic
020			_z9780262518802 _qprint
035			_a(CaBNVSL)mat06482302
035			_a(IDAMS)0b00006481d03dcf
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.9.A43 _bC685 2013eb
082	0	4	_a005.1 _223
100	1		_aCormen, Thomas H., _eauthor. _92186
245	1	0	_aAlgorithms unlocked / _cThomas H. Cormen.
264		1	_aCambridge, Massachusetts : _bMIT Press, _cc2013
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2013]
300			_a1 PDF (xiii, 222 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
504			_aIncludes bibliographical references and index.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aHave 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. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? 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; 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.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aTitle from title screen.
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aComputer algorithms. _94534
655		0	_aElectronic books. _93294
710	2		_aIEEE Xplore (Online Service), _edistributor. _923994
710	2		_aMIT Press, _epublisher. _923995
776	0	8	_iPrint version _z9780262518802
856	4	2	_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6482302
942			_cEBK
999			_c73316 _d73316