Free Course
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.
Course Cost
Free
Timeline
Approx. 2 months
Skill Level
intermediate
Included in Product
Rich Learning Content
Interactive Quizzes
Taught by Industry Pros
Self-Paced Learning
Join the Path to Greatness
Course Leads
Sebastian Wernicke
Instructor
Sean Bennett
Instructor
Sarah Norell
Instructor
What You Will Learn
Prerequisites and Requirements
You should have a basic understanding of algorithms (such as CS215) and programming (such as CS101). No prior knowledge about theoretical computer science required!
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