000			03051cam a2200373Ii 4500
001			ocn830323683
003			OCoLC
005			20240726105344.0
008			130318t20132013maua ob 001 0 eng d
040			_aNT _beng _erda _epn _cNT _dYDXCP _dGZM _dE7B _dIDEBK _dCDX _dCOO _dIEEEE _dCUS _dOCLCF _dIAT _dTEFOD _dOCLCQ _dTEFOD _dOCLCQ _dZ5A _dEBLCP _dYDX _dGRG _dOCLCA _dAGLDB _dMOR _dIUL _dVGM _dUAF _dLIV _dMERUC _dOCLCQ _dJBG _dNJR _dOCLCQ _dUUM _dSTF _dVTS _dCEF _dKSU _dMERER _dOCLCQ _dNTG _dINT _dOCLCQ _dYOU _dUWO _dU3W _dLEAUB _dDKC _dOCLCQ _dNJP _dUKAHL _dOCLCQ _dRECBK _dOCLCO
020			_a9780262313223 _q((electronic)l(electronic)ctronic)
020			_a9780262313230 _q((electronic)l(electronic)ctronic)
050	0	4	_aQA76 _b.A446 2013
049			_aMAIN
100	1		_aCormen, Thomas H., _e1
245	1	0	_aAlgorithms unlocked /Thomas H. Cormen.
260			_aCambridge, Massachusetts : _bThe MIT Press, _c(c)2013.
300			_a1 online resource (xiii, 222 pages) : _billustrations
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_adata file _2rda
504			_a2
505	0	0	_aPreface -- _tWhat are algorithms and why should you care? -- _tHow to describe and evaluate computer algorithms -- _tAlgorithms for sorting and searching -- _tA lower bound for sorting and how to beat it -- _tDirected acyclic graphs -- _tShortest paths -- _tAlgorithms on strings -- _tFoundations of cryptography -- _tData compression -- _tHard? Problems -- _tBibliography -- _tIndex.
520	0		_a"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 simples 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.
530			_a2 _ub
650		0	_aComputer algorithms.
650		0	_aAlgorithms.
655		1	_aElectronic Books.
856	4	0	_uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=548168&site=eds-live&custid=s3260518 _zClick to access digital title | log in using your CIU ID number and my.ciu.edu password
942			_cOB _D _eEB _hQA.. _m2013 _QOL _R _x _8NFIC _2LOC
994			_a92 _bNT
999			_c97651 _d97651
902			_a1 _bCynthia Snell _c1 _dCynthia Snell