Algorithms unlocked / Thomas H. Cormen.

By: Cormen, Thomas H Material type: Text

TextLanguage: English Publication details: Massachusetts : The MIT Press, 2013. Description: xiii, 222 p. : ill. ; 23 cmISBN: 9780262518802Subject(s): Computer algorithmsDDC classification: 005.1 Online resources: WorldCat Details

Contents:

Table of 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 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

Summary: "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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 5 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Date due	Barcode	Item holds
Text	Dr. S. R. Lasker Library, EWU Reserve Section	Non-fiction	005.1 COA 2013 (Browse shelf(Opens below))	C-1	Not For Loan		31585
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 COA 2013 (Browse shelf(Opens below))	C-2	Available		31586

Total holds: 0

Includes bibliographical references (pages 213-214) and index.

Table of 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
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 Science & Engineering Computer Science & Engineering

Sagar Shahanawaz

There are no comments on this title.

to post a comment.