Algorithms Unlocked

ISBN-10: 0262518805

ISBN-13: 9780262518802

Edition: 2013

Authors: Thomas H. Cormen
List price: $30.00 Buy it from $25.00
eBook available
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.

New Starting from $30.05
eBooks Starting from $29.99
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!

Study Briefs

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.

Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS PowerPoint® 2010 Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $30.00
Copyright year: 2013
Publisher: MIT Press
Publication date: 3/1/2013
Binding: Paperback
Pages: 240
Size: 5.75" wide x 9.25" long x 0.75" tall
Weight: 0.792
Language: English

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.

Preface
What Are Algorithms and Why Should You Care?
Correctness
Resource usage
Computer algorithms for non-computer people
Computer algorithms for computer people
Further reading
How to Describe and Evaluate Computer Algorithms
How to describe computer algorithms
How to characterize running times
Loop invariants
Recursion
Further reading
Algorithms for Sorting and Searching
Binary search
Selection sort
Insertion sort
Merge sort
Quicksort
Recap
Further reading
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
Radix sort
Further reading
Directed Acyclic Graphs
Directed acyclic graphs
Topological sorting
How to represent a directed graph
Running time of topological sorting
Critical path in a PERT chart
Shortest path in a directed acyclic graph
Further reading
Shortest Paths
Dijkstra's algorithm
The Bellman-Ford algorithm
The Floyd-Warshall algorithm
Further reading
Algorithms on Strings
Longest common subsequence
Transforming one string to another
String matching
Further reading
Foundations of Cryptography
Simple substitution ciphers
Symmetric-key cryptography
Public-key cryptography
The RSA cryptosystem
Hybrid cryptosystems
Computing random numbers
Further reading
Data Compression
Huffman codes
Fax machines
LZW compression
Further reading
Hard? Problems
Brown trucks
The classes P and NP and NP-completeness
Decision problems and reductions
A Mother Problem
A sampler of NP-complete problems
General strategies
Perspective
Undecidable problems
Wrap-up
Further reading
Bibliography
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×