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
Get Certified Now

View the Nanodegree

Included in Product

Rich Learning Content

Interactive Quizzes

Taught by Industry Pros

Self-Paced Learning

Student Support Community

Join the Path to Greatness

This free course is your first step towards a new career with the Intro to Programming Nanodegree Program.

Free Course

Intro to Theoretical Computer Science

by

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

Icon steps 54aa753742d05d598baf005f2bb1b5bb6339a7d544b84089a1eee6acd5a8543d
 
 

Course Leads

Sebastian Wernicke
Sebastian Wernicke

Instructor

Sean Bennett
Sean Bennett

Instructor

Sarah Norell
Sarah Norell

Instructor

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