Intro to Theoretical Computer Science
Dealing with Challenging Problems
About this Course
This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.
Approx. 2 months
Included in Product
Rich Learning Content
Taught by Industry Pros
What You Will Learn
- What we mean when a problem is "hard" and the concept of NP-completeness.
- Smart techniques to solve problems that should – theoretically – be impossible to solve.
- Why randomness can be of help – sometimes. An introduction to complexity classes.
Prerequisites and Requirements
See the Technology Requirements for using Udacity.
Why Take This Course
At the end of this course, you will have a solid understanding of theoretical computer science. This will not only allow you to recognize some of the most challenging algorithmic problems out there, but also give you powerful tools to deal with them in practice.
What do I get?
- Instructor videos
- Learn by doing exercises
- Taught by industry professionals