1
Algorithms (ArsDigita University). Taught by Shai Simonson, this course discusses the design and analysis of algorithms.
555 years, 6 months
20
The design of algorithms is studied, according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms. Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures. NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms. (from ADUni.org)
Course Currilcum
- Lecture 01 – Algorithms – Overview Unlimited
- Lecture 02 – Sorting Unlimited
- Lecture 03 – Sorting II Unlimited
- Lecture 04 – Searching and Data Structures Unlimited
- Lecture 05 – Red-Black Trees Unlimited
- Lecture 06 – Graph Algorithms I: Topological Sorting, Prim’s Algorithm Unlimited
- Lecture 07 – Graph Algorithm II: DFS, BFS, Kruskal’s Algorithm, Union Find Data Structure Unlimited
- Lecture 08 – Graph Algorithm III: Shortest Path Unlimited
- Lecture 09 – Graph Algorithm IV: Intro to Geometric Algorithms Unlimited
- Lecture 10 – Geometric Algorithms: Graham & Jarvis Unlimited
- Lecture 11 – Dynamic Programming I Unlimited
- Lecture 12 – Dynamic Programming II Unlimited
- Lecture 13 – Parsing Unlimited
- Lecture 14 – Knapsack, Bandwidth Min. Intro – Greedy Algorithms Unlimited
- Lecture 15 – Greedy Algorithms II. Intro to NP Completeness Unlimited
- Lecture 16 – NP Completeness II & Reductions Unlimited
- Lecture 17 – NP Completeness III – More Reductions Unlimited
- Lecture 18 – NP Completeness IV Unlimited
- Lecture 19 – Approximation Algorithms Unlimited
- Lecture 20 – Alternate Models of Computation Unlimited
