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.

Watch Trailer
Course Cost
Free
Timeline
Approx. 2 months
Skill Level
intermediate
Included in Product

Join the Path to Greatness

Free Course

Intro to Theoretical Computer Science

Enhance your skill set and boost your hirability through innovative, independent learning.

Icon steps

Course Leads

Sebastian Wernicke

Sebastian Wernicke

Instructor

Sean Bennett

Sean Bennett

Instructor

Sarah Norell

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?