Advanced Algorithms Analysis and Design - Lecture 20: 0-1 knapsack problem’s algorithm (using dynamic programming) and optimal weight triangulation

Advanced Algorithms Analysis and Design - Lecture 42: String matching

30 p | 8 | 2

Advanced Algorithms Analysis and Design - Lecture 39: Number theoretic algorithms (Theorems and algorithms)

36 p | 16 | 1

Advanced Algorithms Analysis and Design - Lecture 37: The Floyd-Warshall algorithm and Johnson’s algorithm

40 p | 7 | 1

Advanced Algorithms Analysis and Design - Lecture 31: Backtracking and branch & bound algorithms

21 p | 10 | 1

Advanced Algorithms Analysis and Design - Lecture 26: Huffman coding

26 p | 9 | 1

Advanced Algorithms Analysis and Design - Lecture 14: Designing algorithms using Divide & Conquer approach

43 p | 12 | 1

Advanced Algorithms Analysis and Design - Lecture 12: Design of algorithms using Brute Force Approach

35 p | 15 | 1

Advanced Algorithms Analysis and Design - Lecture 3: Logic and Proving Techniques

25 p | 8 | 1

Advanced Algorithms Analysis and Design - Lecture 44: NP completeness

35 p | 8 | 1