This course introduces the mathematical design and analysis of computer algorithms. Algorithm complexity, growth of functions, recurrences will be covered. Algorithm design techniques such as divide-and-conquer, dynamic programming and greediness will be introduced. Moreover, well known algorithms for e.g., sorting, searching, graph problems and computational geometry will be developed.
Artificial Intelligence 132 CRs
Anany Levitin, An Introduction to the Design and Analysis of Algorithms, Pearson
| content serial | Description |
|---|---|
| 1 | Introduction |
| 2 | Algorithms analysis and sorting techniques part 1 |
| 3 | Algorithms analysis and sorting techniques part 2 |
| 4 | Recurrences part 1 |
| 5 | Recurrences part 2 |
| 6 | Brute Force Algorithms part 1 |
| 7 | Brute Force Algorithms part 2 |
| 8 | Greedy Algorithms part 1 |
| 9 | Greedy Algorithms part 2 |
| 10 | Dynamic Programming part 1 |
| 11 | Dynamic Programming part 2 |
| 12 | Divide and Conquer |
| 13 | Graph Algorithms |
| 14 | Parallel Algorithms part 1 |
| 15 | Parallel Algorithms part 2 |
Start your application
