Week 1-4 lectures | Design and analysis of algorithms | NPTEL | Chennai Mathematical Institute

Описание: https://onlinecourses.nptel.ac.in/noc25_cs...

0:00 (1/8/1) Intro to Course
9:25 (2/8/1) Airline example
18:57 (3/8/1) Xerox shop example
25:17 (4/8/1) Document similarity
34:47 (5/8/1) Analysis
53:21 (6/8/1) worst vs Avg
1:03:48 (7/8/1) Notations
1:21:53 (8/8/1) TC of programs
1:39:13 (1/9/2) Arrays & Lists
1:45:36 (2/9/2) Searching in Array
1:54:46 (3/9/2) Selection Sort
2:06:57 (4/9/2) Insertion Sort
2:20:49 (5/9/2) Merge Sort
2:34:35 (6/9/2) Merge Sort Analysis
2:49:45 (7/9/2) Quick Sort
3:06:52 (8/9/2) Quick Sort Analysis
3:19:10 (9/9/2) Sorting Conclusion
3:27:16 (1/7/3) Graphs Intro
3:39:20 (2/7/3) Representing Graph
3:53:06 (3/7/3) Breadth First Search (BFS)
4:13:45 (4/7/3) Depth First Search (DFS)
4:26:28 (5/7/3) Applications BFS DFS
4:48:52 (6/7/3) Directed Acyclic Graph (DAG)
5:09:19 (7/7/3) DAG: Longest paths
5:23:18 (1/7/4) Dijkstra's algorithm
5:39:33 (2/7/4) Dijkstra's algorithm Analysis
5:53:54 (3/7/4) Bellman-Ford algorithm
6:10:36 (4/7/4) All pairs shortest paths
6:30:12 (5/7/4) Minimum Cost Spanning Trees
6:42:11 (6/7/4) Prim's Algorithm
7:03:22 (7/7/4) Kruskal's algorithm

Week 1-4 lectures
Design and analysis of algorithms (NPTEL)
By Prof. Madhavan Mukund
Chennai Mathematical Institute
https://onlinecourses.nptel.ac.in/noc25_cs...