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.
Software Engineering 144 CRs
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, The MIT Press
content serial | Description |
---|---|
1 | Introduction |
2 | Algorithms analysis and sorting techniques |
3 | Recurrences |
4 | Brute Force Algorithm |
5 | Greedy Algorithms |
6 | Greedy Algorithms (cont.) |
7 | 7th Week Exam |
8 | Dynamic programming |
9 | Divide and Conquer |
10 | Back-Tracking |
11 | Graph Algorithms |
12 | 12th Week Exam |
13 | String Algorithms |
14 | Computational Geometry |
15 | Revision |
16 | Final Exam |
Start your application