Home » Course Layouts » Free Course Layout Udemy
This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms.
0
1
English
English [CC]
FREE
- Learn basic syntax that can apply to any language.
- Learn what is a programming language and the basic concepts for beginners.
- Understand what is Javascript in it's truest form.
- Know the basic syntax of Javascript.
- Know some hidden quirks in Javascript.
Description
It is especially designed for doctoral students interested in theoretical computer science.
Course content
- Fibonacci heaps Unlimited
- Network flows Unlimited
- Maximum flow; minimum cost circulation Unlimited
- Goldberg-Tarjan min-cost circulation algorithm Unlimited
- Cancel-and-tighten algorithm; binary search trees Unlimited
- Splay trees Unlimited
- Dynamic trees (part 1) Unlimited
- Dynamic trees (part 2) Unlimited
- Linear programming (LP) Unlimited
- LP: duality, geometry, simplex Unlimited
- LP: complexity; introduction to the ellipsoid algorithm Unlimited
- LP: ellipsoid algorithm Unlimited
- Conic programming I Unlimited
- Conic programming II Unlimited
- Approximation algorithms Unlimited
- Approximation algorithms (facility location) Unlimited
- Approximation algorithms (max-cut) Unlimited
- Max-cut and sparsest-cut Unlimited
- Convex hulls and fixed dimension LP Unlimited
- Voronoi diagrams Unlimited
Instructor
Massachusetts Institute of Technology
5
5
1
1916
1520
