Advanced Algorithms Analysis and Design - Lecture 35: Dijkstra’s algorithm

Advanced Algorithms Analysis and Design - Lecture 1: Introduction

20 p | 20 | 1

Advanced Algorithms Analysis and Design - Lecture 38: Number theoretic algorithms (Definitions and some important results)

38 p | 8 | 1

Advanced Algorithms Analysis and Design - Lecture 34: Proof: Bellman-Ford algorithm and Shortest paths in Directed acyclic graphs

24 p | 11 | 1

Advanced Algorithms Analysis and Design - Lecture 29: Proof (Breadth first search algorithm) & Depth first search

38 p | 6 | 1

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

39 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