Design & Analysis of Algorithms by Abhiram Ranade (IIT Bombay)

# click the upper-left icon to select videos from the playlist

source: nptelhrd    2008年8月26日
Computer Sc - Design & Analysis of Algorithms by Prof. Abhiram Ranade, Department of Computer Science Engineering, IIT Bombay.

1 Overview of the course 51:51
2 Framework for Algorithms Analysis 56:22
3 Algorithms Analysis Framework - II 53:11
4 Asymptotic Notation 53:25
5 Algorithm Design Techniques: Basics 46:24
6 Divide And Conquer-I 52:09
7 Divide And Conquer -II Median Finding 52:55
8 Divide And Conquer -III Surfing Lower Bounds 56:48
9 Divide And Conquer -IV Closest Pair 1:03:38
10 Greedy Algorithms -I 51:19
11 Greedy Algorithms - II 53:58
12 Greedy Algorithms - III 50:44
13 Greedy Algorithms - IV 36:45
14 Pattern Matching - I 54:11
15 Pattern Matching - II 45:02
16 Combinational Search and Optimization I 54:41
17 Combinational Search and Optimization II 54:08
18 Dynamic Programming 52:19
19 Longest Common Subsequences 58:59
20 Matric Chain Multiplication 51:26
21 Scheduling with Startup and Holding Costs 54:02
22 Average case Analysis of Quicksort 48:16
23 Bipartite Maximum Matching 51:29
24 Lower Bounds for Sorting 48:39
25 Element Distinctness Lower Bounds 54:26
26 NP-Completeness-I -Motivation 58:16
27 NP - Completeness - II 1:16:39
28 NP-Completeness - III 57:24
29 NP-Completeness - IV 1:10:11
30 NP-Completeness - V 41:18
31 NP-Completeness - VI 40:57
32 Approximation Algorithms 55:02
33 Approximation Algorithms 58:12
34 Approximation Algorithms for NP 53:38