2021 JAN – JUN IT SEM4 COA Lecture Videos below
| Lecture 01: Greedy Knapsack |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 02: Greedy Kruskal (MST) |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
Lecture 03: Greedy Prims (MST) |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
Lecture 04: Greedy Dijkstra (Single Source Shortest Path) |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 05: Greedy Job Scheduling with Deadlines |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 06: MinMax by Divide and Conquer |
| DIRECT Server FEED coming soon |
| ALTERNATE YOUTUBE FEED Coming soon |
| Lecture 07: Master Theorem |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 08: dynamic Programming: Multistage Graph |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 09: dynamic Programming: All Pairs Shortest Path & Bellman Ford |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 10: dynamic Programming: Longest Common Subsequence |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 11: dynamic Programming: 0/1 Knapsack |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 12: BrackTracking: N-Queens |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 13: BrackTracking: Sum of Subsets |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 14: BrackTracking: Graph Colouring |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |
| Lecture 15: Branch and Bound: 15 Puzzle |
| DIRECT Server FEED |
| ALTERNATE YOUTUBE FEED |