By Topic

Algorithms Unlocked

Cover Image Copyright Year: 2013
Author(s): Thomas H. Cormen
Publisher: MIT Press
Content Type : Books & eBooks
Topics: Communication, Networking & Broadcasting ;  Components, Circuits, Devices & Systems ;  Computing & Processing
  • Print

Abstract

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 card account 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 your smart phone? 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 simple 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; 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.

  •   Click to expandTable of Contents

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Frontmatter

      Page(s): i - xiii
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Half title, Title, Copyright, Contents, Dedication, Preface View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      What Are Algorithms and Why Should You Care?

      Page(s): 1 - 9
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Correctness, Resource usage, Computer algorithms for non-computer people, Computer algorithms for computer people, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      How to Describe and Evaluate Computer Algorithms

      Page(s): 10 - 24
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: How to describe computer algorithms, How to characterize running times, Loop invariants, Recursion, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Algorithms for Sorting and Searching

      Page(s): 25 - 59
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Binary search, Selection sort, Insertion sort, Merge sort, Quicksort, Recap, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      A Lower Bound for Sorting and How to Beat It

      Page(s): 60 - 70
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Rules for sorting, The lower bound on comparison sorting, Beating the lower bound with counting sort, Radix sort, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Directed Acyclic Graphs

      Page(s): 71 - 89
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: 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 View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Shortest Paths

      Page(s): 90 - 114
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Dijkstra's algorithm, The Bellman-Ford algorithm, The Floyd-Warshall algorithm, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Algorithms on Strings

      Page(s): 115 - 137
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Longest common subsequence, Transforming one string to another, String matching, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Foundations of Cryptography

      Page(s): 138 - 157
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Simple substitution ciphers, Symmetric-key cryptography, Public-key cryptography, The RSA cryptosystem, Hybrid cryptosystems, Computing random numbers, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Data Compression

      Page(s): 158 - 178
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: Huffman codes, Fax machines, LZW compression, Further reading View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Hard? Problems

      Page(s): 179 - 212
      Copyright Year: 2013

      MIT Press eBook Chapters

      This chapter contains sections titled: 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 View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Bibliography

      Page(s): 213 - 214
      Copyright Year: 2013

      MIT Press eBook Chapters

      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 card account 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 your smart phone? 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 simple 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; 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. View full abstract»

    • Full text access may be available. Click article title to sign in or learn about subscription options.

      Index

      Page(s): 215 - 222
      Copyright Year: 2013

      MIT Press eBook Chapters

      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 card account 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 your smart phone? 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 simple 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; 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. View full abstract»