Free Course
Introduction to Graduate Algorithms
by
Offered at Georgia Tech as CS 8803 GA
Nanodegree Program
Accelerate your career with the credential that fast-tracks you to job success.
About this Course
This is a graduate-level course in the design and analysis of algorithms. We study techniques for the design of algorithms (such as dynamic programming) and algorithms for fundamental problems (such as fast Fourier transform or FFT).
In addition, we study computational intractability, specifically, the theory of NP-completeness. The main topics covered in the course include: dynamic programming; divide and conquer, including FFT; randomized algorithms, including RSA cryptosystem and hashing using Bloom filters; graph algorithms; max-flow algorithms; linear programming; and NP-completeness.
Course Cost
Free
Timeline
Approx. 3 months
Skill Level
advanced
Included in Product
Rich Learning Content
Interactive Quizzes
Taught by Industry Pros
Self-Paced Learning
Student Support Community
Join the Path to Greatness
This course is your first step towards a new career with the Program.
Free Course
Introduction to Graduate Algorithms
Enhance your skill set and boost your hirability through innovative, independent learning.
Course Leads
Eric Vigoda
Instructor
Arpan Chakraborty
Instructor
Prerequisites and Requirements
Students are expected to have an undergraduate course on the design and analysis of algorithms. In particular, they should be familiar with basic graph algorithms, including DFS, BFS, and Dijkstra's shortest path algorithm, and basic dynamic programming and divide and conquer algorithms (including solving recurrences). An undergraduate course in discrete mathematics is assumed, and students should be comfortable analyzing the asymptotic running time of algorithms.
The course uses the textbook Algorithms by Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani.
See the Technology Requirements for using Udacity.
Our Nanodegrees are packed with much more
Nanodegree Certitification
Rich Learning Content
Interactive Quizzes
Self Paced Learning
Taught by Industry Professionals
1-1 Coaching and Mentorship
Free Courses
Rich Learning Content
Interactive Quizzes
Self Paced Learning
Taught by Industry Professionals
Why Take This Course
The design and analysis of algorithms form an essential basis for computer science. This course is useful for those who want to pursue advanced studies in computer science, as well as those who want to work as a software engineer.
