Georgia Institute of Technology - Introduction to Graduate Algorithms
- Offered byUDACITY
Introduction to Graduate Algorithms at UDACITY Overview
Introduction to Graduate Algorithms
at UDACITY
Offered at Georgia Tech as CS 8803 GA
Duration | 3 months |
Total fee | Free |
Mode of learning | Online |
Schedule type | Self paced |
Difficulty level | Intermediate |
Credential | Certificate |
Introduction to Graduate Algorithms at UDACITY Highlights
Introduction to Graduate Algorithms
at UDACITY
- Taught by Industry Pros
- Student Support Community
- Rich Learning Content
- Self-Paced Learning
Read more
Introduction to Graduate Algorithms at UDACITY Course details
Introduction to Graduate Algorithms
at UDACITY
What are the course deliverables?
- Enhance your skill set and boost your hirability through innovative, independent learning.
- Taught by industry professionals
More 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.
Introduction to Graduate Algorithms at UDACITY Curriculum
Introduction to Graduate Algorithms
at UDACITY
LESSON 1: Dynamic Programming
LESSON 2: Randomized Algorithms
LESSON 3: Divide and Conquer
LESSON 4: Graph Algorithms
LESSON 5: Max-Flow Problems
LESSON 6: Linear Programming
Other courses offered by UDACITY
View Other 435 Courses
Introduction to Graduate Algorithms
at UDACITY
Student Forum
Anything you would want to ask experts?