Free Course
Introduction to Graduate Algorithms
by
Offered at Georgia Tech as CS 8803 GA
Nanodegree Program
iOS Developer
by
Become an iOS Developer
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 iOS Developer Program.
Free Course
Introduction to Graduate Algorithms
by
Enhance your skill set and boost your hirability through innovative, independent learning.
Course Leads
Eric Vigoda
Instructor
Arpan Chakraborty
Instructor
What You Will Learn
lesson 1
Dynamic Programming
- Fibonacci Numbers, Longest Increasing Subsequence (LIS), Longest Common Subsequence (LCS)
- Knapsack, Chain Matrix Multiplication
- Shortest Path Algorithms
lesson 2
Randomized Algorithms
- Modular Arithmetic: Fast Modular Exponentiation, Multiplicative Inverses
- RSA Cryptosystem: Fermat's Little Theorem, RSA Protocol, Primality Testing
- Hashing: Traditional Chain Hashing, Bloom Filters
lesson 3
Divide and Conquer
- Fast Integer Multiplication
- Linear-Time Median
- Fast Fourier Transform
lesson 4
Graph Algorithms
- Strongly Connected Components, 2-Satisfiability
- Minimum Spanning Tree
- Markov Chains, PageRank
lesson 5
Max-Flow Problems
- Ford-Fulkerson Algorithm
- Max-Flow Min-Cut Theorem, Edmonds-Karp Algorithm
- Max-Flow applied to Image Segmentation
lesson 6
Linear Programming
- Simplex Algorithm
- Weak and Strong Duality
- Max-SAT Approximation
lesson 7
NP-Completeness
- Complexity Classes: P, NP, NP-Complete
- NP-Complete Problems: 3-SAT, Independent Set, Clique, Vertex Cover, Knapsack, Subset-Sum
- Halting Problem
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.
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.