MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
You will learn a wealth of tools and techniques that will help you recognize when problems you encounter in the real-world are intractable and when there an efficient solution. This can save you countless hours that otherwise would have been spent on a fruitless endeavor or in re-inventing the wheel.
What you will learn
Computability
- Languages & Countability
- Turing Machines
- The Church-Turing Thesis
Complexity
- P and NP
- NP-Complete Problems
- The Golden Ticket
Algorithms
- Dynamic Programming
- Fast Fourier Transform
- Maximum Flow
Prerequisites and requirements
Students are expected to have a solid grasp of the basics of discrete mathematics. Discrete Mathematics and Its Applications by Ken Rosen provides an excellent background for this course.
If you answer "no" to any of the following questions, it may be beneficial to acquire background knowledge concurrently or prior to taking the course.
1. Can you show that the sum of the first n numbers is n(n+1)/2? Can you give the proof as an induction on n?
2. Can you give an O(n log n) algorithm for sorting n numbers?
3. Can you describe the difference between breadth-first and depth-first search?
4. Given an nxn matrix A and an n-dimensional vector b, can you give a polynomial-time algorithm to find a vector x such that Ax=b?
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.