Verfügbarkeit: Algorithms unlocked /

Algorithms unlocked /:

"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. Rea...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Cormen, Thomas H. (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge, Massachusetts : The MIT Press, [2013]
Schlagworte:	Computer algorithms. Algorithms. Algorithms Algorithmes. algorithms. COMPUTERS > Programming > Open Source. COMPUTERS > Software Development & Engineering > General. COMPUTERS > Software Development & Engineering > Tools. Computer algorithms Algorithmus Programm Algorismes computacionals.
Online-Zugang:	Volltext
Zusammenfassung:	"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.
Beschreibung:	1 online resource (xiii, 222 pages) : illustrations
Bibliographie:	Includes bibliographical references and index.
ISBN:	9780262313223 0262313227 9780262313230 0262313235 9781299284272 1299284272

Internformat

MARC


LEADER	00000cam a2200000 i 4500
001	ZDB-4-EBA-ocn830323683
003	OCoLC
005	20241004212047.0
006	m o d
007	cr cnu---unuuu
008	130318t20132013maua ob 001 0 eng d
040			\|a N$T \|b eng \|e rda \|e pn \|c N$T \|d YDXCP \|d GZM \|d E7B \|d IDEBK \|d CDX \|d COO \|d IEEEE \|d CUS \|d OCLCF \|d IAT \|d TEFOD \|d OCLCQ \|d TEFOD \|d OCLCQ \|d Z5A \|d EBLCP \|d YDX \|d GRG \|d OCLCA \|d AGLDB \|d MOR \|d IUL \|d VGM \|d UAF \|d LIV \|d MERUC \|d OCLCQ \|d JBG \|d NJR \|d OCLCQ \|d UUM \|d STF \|d VTS \|d CEF \|d KSU \|d MERER \|d OCLCQ \|d NTG \|d INT \|d OCLCQ \|d YOU \|d UWO \|d U3W \|d LEAUB \|d DKC \|d OCLCQ \|d NJP \|d UKAHL \|d OCLCQ \|d RECBK \|d OCLCO \|d OCL \|d OCLCQ \|d OCLCO \|d OCLCQ \|d OCLCL \|d SFB \|d OCLCO \|d OCLCQ
019			\|a 959320347 \|a 959582857 \|a 988417523 \|a 991307055 \|a 1037938461 \|a 1067203407 \|a 1114257504 \|a 1164459035 \|a 1167377048
020			\|a 9780262313223 \|q (electronic bk.)
020			\|a 0262313227 \|q (electronic bk.)
020			\|a 9780262313230 \|q (electronic bk.)
020			\|a 0262313235 \|q (electronic bk.)
020			\|a 9781299284272 \|q (MyiLibrary e-book)
020			\|a 1299284272 \|q (MyiLibrary e-book)
020			\|z 9780262518802
020			\|z 0262518805
035			\|a (OCoLC)830323683 \|z (OCoLC)959320347 \|z (OCoLC)959582857 \|z (OCoLC)988417523 \|z (OCoLC)991307055 \|z (OCoLC)1037938461 \|z (OCoLC)1067203407 \|z (OCoLC)1114257504 \|z (OCoLC)1164459035 \|z (OCoLC)1167377048
037			\|a F1D48311-7A9C-4582-81A0-F63FB503B95D \|b OverDrive, Inc. \|n http://www.overdrive.com
050		4	\|a QA76.9.A43 \|b C685 2013eb
072		7	\|a COM \|x 051390 \|2 bisacsh
072		7	\|a COM \|x 051230 \|2 bisacsh
072		7	\|a COM \|x 051440 \|2 bisacsh
082	7		\|a 005.1 \|2 23
049			\|a MAIN
100	1		\|a Cormen, Thomas H., \|e author.
245	1	0	\|a Algorithms unlocked / \|c Thomas H. Cormen.
264		1	\|a Cambridge, Massachusetts : \|b The MIT Press, \|c [2013]
264		4	\|c ©2013
300			\|a 1 online resource (xiii, 222 pages) : \|b illustrations
336			\|a text \|b txt \|2 rdacontent
337			\|a computer \|b c \|2 rdamedia
338			\|a online resource \|b cr \|2 rdacarrier
504			\|a Includes bibliographical references and index.
588	0		\|a Print version record.
505	0		\|a Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index.
520			\|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.
650		0	\|a Computer algorithms. \|0 http://id.loc.gov/authorities/subjects/sh91000149
650		0	\|a Algorithms. \|0 http://id.loc.gov/authorities/subjects/sh85003487
650		2	\|a Algorithms \|0 https://id.nlm.nih.gov/mesh/D000465
650		6	\|a Algorithmes.
650		7	\|a algorithms. \|2 aat
650		7	\|a COMPUTERS \|x Programming \|x Open Source. \|2 bisacsh
650		7	\|a COMPUTERS \|x Software Development & Engineering \|x General. \|2 bisacsh
650		7	\|a COMPUTERS \|x Software Development & Engineering \|x Tools. \|2 bisacsh
650		7	\|a Algorithms \|2 fast
650		7	\|a Computer algorithms \|2 fast
650		7	\|a Algorithmus \|2 gnd
650		7	\|a Programm \|2 gnd
650		7	\|a Algorismes computacionals. \|2 lemac
758			\|i has work: \|a Algorithms unlocked (Text) \|1 https://id.oclc.org/worldcat/entity/E39PCGkrCtQCh7HRPKYMqVxfYP \|4 https://id.oclc.org/worldcat/ontology/hasWork
776	0	8	\|i Print version: \|a Cormen, Thomas H. \|t Algorithms Unlocked. \|d Cambridge, Massachusetts : The MIT Press, [2013] \|z 9780262518802 \|w (DLC) 2012036810 \|w (OCoLC)813540952
856	4	0	\|l FWS01 \|p ZDB-4-EBA \|q FWS_PDA_EBA \|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=548168 \|3 Volltext
938			\|a YBP Library Services \|b YANK \|n 10313963
938			\|a ProQuest MyiLibrary Digital eBook Collection \|b IDEB \|n cis25064408
938			\|a EBSCOhost \|b EBSC \|n 548168
938			\|a ebrary \|b EBRY \|n ebr10672795
938			\|a EBL - Ebook Library \|b EBLB \|n EBL3339585
938			\|a Coutts Information Services \|b COUT \|n 25064408
938			\|a Askews and Holts Library Services \|b ASKH \|n AH33866717
938			\|a Recorded Books, LLC \|b RECE \|n rbeEB00827468
938			\|a Askews and Holts Library Services \|b ASKH \|n AH28316442
938			\|a IEEE \|b IEEE \|n 6482302
994			\|a 92 \|b GEBAY
912			\|a ZDB-4-EBA
049			\|a DE-863

Datensatz im Suchindex

DE-BY-FWS_katkey	ZDB-4-EBA-ocn830323683
_version_	1816882225547837440
adam_text
any_adam_object
author	Cormen, Thomas H.
author_facet	Cormen, Thomas H.
author_role	aut
author_sort	Cormen, Thomas H.
author_variant	t h c th thc
building	Verbundindex
bvnumber	localFWS
callnumber-first	Q - Science
callnumber-label	QA76
callnumber-raw	QA76.9.A43 C685 2013eb
callnumber-search	QA76.9.A43 C685 2013eb
callnumber-sort	QA 276.9 A43 C685 42013EB
callnumber-subject	QA - Mathematics
collection	ZDB-4-EBA
contents	Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index.
ctrlnum	(OCoLC)830323683
dewey-full	005.1
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	005 - Computer programming, programs, data, security
dewey-raw	005.1
dewey-search	005.1
dewey-sort	15.1
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
format	Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05220cam a2200781 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn830323683</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">130318t20132013maua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDXCP</subfield><subfield code="d">GZM</subfield><subfield code="d">E7B</subfield><subfield code="d">IDEBK</subfield><subfield code="d">CDX</subfield><subfield code="d">COO</subfield><subfield code="d">IEEEE</subfield><subfield code="d">CUS</subfield><subfield code="d">OCLCF</subfield><subfield code="d">IAT</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">Z5A</subfield><subfield code="d">EBLCP</subfield><subfield code="d">YDX</subfield><subfield code="d">GRG</subfield><subfield code="d">OCLCA</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">IUL</subfield><subfield code="d">VGM</subfield><subfield code="d">UAF</subfield><subfield code="d">LIV</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">JBG</subfield><subfield code="d">NJR</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UUM</subfield><subfield code="d">STF</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">KSU</subfield><subfield code="d">MERER</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NTG</subfield><subfield code="d">INT</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YOU</subfield><subfield code="d">UWO</subfield><subfield code="d">U3W</subfield><subfield code="d">LEAUB</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NJP</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">RECBK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">959320347</subfield><subfield code="a">959582857</subfield><subfield code="a">988417523</subfield><subfield code="a">991307055</subfield><subfield code="a">1037938461</subfield><subfield code="a">1067203407</subfield><subfield code="a">1114257504</subfield><subfield code="a">1164459035</subfield><subfield code="a">1167377048</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262313223</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262313227</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262313230</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262313235</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299284272</subfield><subfield code="q">(MyiLibrary e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299284272</subfield><subfield code="q">(MyiLibrary e-book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780262518802</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">0262518805</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)830323683</subfield><subfield code="z">(OCoLC)959320347</subfield><subfield code="z">(OCoLC)959582857</subfield><subfield code="z">(OCoLC)988417523</subfield><subfield code="z">(OCoLC)991307055</subfield><subfield code="z">(OCoLC)1037938461</subfield><subfield code="z">(OCoLC)1067203407</subfield><subfield code="z">(OCoLC)1114257504</subfield><subfield code="z">(OCoLC)1164459035</subfield><subfield code="z">(OCoLC)1167377048</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">F1D48311-7A9C-4582-81A0-F63FB503B95D</subfield><subfield code="b">OverDrive, Inc.</subfield><subfield code="n">http://www.overdrive.com</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.A43</subfield><subfield code="b">C685 2013eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051390</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051230</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051440</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cormen, Thomas H.,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms unlocked /</subfield><subfield code="c">Thomas H. Cormen.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts :</subfield><subfield code="b">The MIT Press,</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiii, 222 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">Open Source.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">Tools.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programm</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorismes computacionals.</subfield><subfield code="2">lemac</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Algorithms unlocked (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGkrCtQCh7HRPKYMqVxfYP</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Cormen, Thomas H.</subfield><subfield code="t">Algorithms Unlocked.</subfield><subfield code="d">Cambridge, Massachusetts : The MIT Press, [2013]</subfield><subfield code="z">9780262518802</subfield><subfield code="w">(DLC) 2012036810</subfield><subfield code="w">(OCoLC)813540952</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=548168</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10313963</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis25064408</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">548168</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10672795</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL3339585</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">25064408</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH33866717</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Recorded Books, LLC</subfield><subfield code="b">RECE</subfield><subfield code="n">rbeEB00827468</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH28316442</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">IEEE</subfield><subfield code="b">IEEE</subfield><subfield code="n">6482302</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection>
id	ZDB-4-EBA-ocn830323683
illustrated	Illustrated
indexdate	2024-11-27T13:25:14Z
institution	BVB
isbn	9780262313223 0262313227 9780262313230 0262313235 9781299284272 1299284272
language	English
oclc_num	830323683
open_access_boolean
owner	MAIN DE-863 DE-BY-FWS
owner_facet	MAIN DE-863 DE-BY-FWS
physical	1 online resource (xiii, 222 pages) : illustrations
psigel	ZDB-4-EBA
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	The MIT Press,
record_format	marc
spelling	Cormen, Thomas H., author. Algorithms unlocked / Thomas H. Cormen. Cambridge, Massachusetts : The MIT Press, [2013] ©2013 1 online resource (xiii, 222 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. Print version record. Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index. "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. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh Algorithms fast Computer algorithms fast Algorithmus gnd Programm gnd Algorismes computacionals. lemac has work: Algorithms unlocked (Text) https://id.oclc.org/worldcat/entity/E39PCGkrCtQCh7HRPKYMqVxfYP https://id.oclc.org/worldcat/ontology/hasWork Print version: Cormen, Thomas H. Algorithms Unlocked. Cambridge, Massachusetts : The MIT Press, [2013] 9780262518802 (DLC) 2012036810 (OCoLC)813540952 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=548168 Volltext
spellingShingle	Cormen, Thomas H. Algorithms unlocked / Preface -- What are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems -- Bibliography -- Index. Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh Algorithms fast Computer algorithms fast Algorithmus gnd Programm gnd Algorismes computacionals. lemac
subject_GND	http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh85003487 https://id.nlm.nih.gov/mesh/D000465
title	Algorithms unlocked /
title_auth	Algorithms unlocked /
title_exact_search	Algorithms unlocked /
title_full	Algorithms unlocked / Thomas H. Cormen.
title_fullStr	Algorithms unlocked / Thomas H. Cormen.
title_full_unstemmed	Algorithms unlocked / Thomas H. Cormen.
title_short	Algorithms unlocked /
title_sort	algorithms unlocked
topic	Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Algorithmes. algorithms. aat COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh Algorithms fast Computer algorithms fast Algorithmus gnd Programm gnd Algorismes computacionals. lemac
topic_facet	Computer algorithms. Algorithms. Algorithms Algorithmes. algorithms. COMPUTERS Programming Open Source. COMPUTERS Software Development & Engineering General. COMPUTERS Software Development & Engineering Tools. Computer algorithms Algorithmus Programm Algorismes computacionals.
url	https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=548168
work_keys_str_mv	AT cormenthomash algorithmsunlocked

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge