List price: $30.00
Buy it from $14.12
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: 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 cardaccount 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 yoursmart phone? This book offers an engagingly written guide to the basics of computer algorithms. InAlgorithms Demystified, Thomas Cormen -- coauthor of the leading college textbookon the subject -- provides a general explanation, with limited mathematics, of how algorithms enablecomputers 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"); howto 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 financialrelationships); how to solve problems that ask questions about strings of characters such as DNAstructures; the basic principles behind cryptography; fundamentals of data compression; and eventhat there are some problems that no one has figured out how to solve on a computer in a reasonableamount of time.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $30.00
Copyright year: 2013
Publisher: MIT Press
Publication date: 3/1/2013
Size: 5.75" wide x 9.25" long x 0.75" tall
Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.
|What Are Algorithms and Why Should You Care?|
|Computer algorithms for non-computer people|
|Computer algorithms for computer people|
|How to Describe and Evaluate Computer Algorithms|
|How to describe computer algorithms|
|How to characterize running times|
|Algorithms for Sorting and Searching|
|A Lower Bound for Sorting and How to Beat It|
|Rules for sorting|
|The lower bound on comparison sorting|
|Beating the lower bound with counting sort|
|Directed Acyclic Graphs|
|Directed acyclic graphs|
|How to represent a directed graph|
|Running time of topological sorting|
|Critical path in a PERT chart|
|Shortest path in a directed acyclic graph|
|The Bellman-Ford algorithm|
|The Floyd-Warshall algorithm|
|Algorithms on Strings|
|Longest common subsequence|
|Transforming one string to another|
|Foundations of Cryptography|
|Simple substitution ciphers|
|The RSA cryptosystem|
|Computing random numbers|
|The classes P and NP and NP-completeness|
|Decision problems and reductions|
|A Mother Problem|
|A sampler of NP-complete problems|