Introduction to Graduate Algorithms

Free Course
12 weeks duration

Learn advanced techniques for designing algorithms and apply them to hard computational problems.

The course Introduction to Graduate Algorithms on Udacity covers a wide range of topics in algorithms. It starts with dynamic programming, including Fibonacci numbers, longest increasing subsequence, and longest common subsequence. It then moves on to knapsack problems, chain matrix multiplication, and shortest path algorithms. The course also covers randomized algorithms, modular arithmetic, RSA cryptosystem, hashing, divide and conquer, fast integer multiplication, linear-time median, fast Fourier transform, graph algorithms, Markov chains, max-flow problems, linear programming, NP-completeness, and complexity classes. The course concludes with a discussion on the halting problem.

About Provider

Online Education Provider ยท 302 courses
Udacity is an online learning platform that offers a wide range of courses and programs in various fields such as technology, business, data science, and artificial intelligence. It was founded in 2012 by Sebastian Thrun, David Stavens, and Mike Sokolsky with the aim of providing accessible and affordable education to individuals worldwide. Udacity's courses are designed in collaboration with industry experts and leading companies, ensuring that the content is relevant and up-to-date. The platform offers both self-paced courses and guided programs, allowing learners to choose the learning style that suits them best. Udacity also provides career services and support, including resume reviews, interview preparation, and job placement assistance, to help learners transition into their desired careers.
You need to login in order to be able to rate the course.
Register Login


This course has not been reviewed by the community yet.