Lectures in this course:32
1 - Introduction (35:51)
2 - C Programming - I (34:58)
3 - C Programming - II (47:13)
4 - C Programming - III (36:26)
5 - Data Structuring: Case Study - I (46:54)
6 - Data Structuring: Case Study - II (34:27)
7 - Data Structuring: Case Study - III (39:52)
8 - Problem Decomposition By Recursion - I (42:57)
9 - Problem Decomposition By Recursion - II (41:58)
10 - Problem Decomposition By Recursion - III (32:20)
11 - Merge sort And Quick sort (43:32)
12 - Characters And Strings (42:36)
13 - Arrays: Addresses And Contents (34:15)
14 - Structures - I (35:51)
15 - Structures - II (32:33)
16 - Dynamic Allocation Part - I (37:02)
17 - Linked Lists - I (42:09)
18 - Complexity (Efficiency) of Algorithms (35:09)
19 - Asymptotic Growth Functions (43:15)
20 - Asymptotic Analysis of Algorithms (36:46)
21 - Data Structuring (44:03)
22 - Search Trees (42:22)
23 - Search Trees - II (41:05)
24 - Search Trees - III (37:57)
25 - 2-3 Trees (41:31)
26 - Algorithm Design - I (37:32)
27 - Algorithm Design - II (29:40)
28 - Algorithm Design - III (38:17)
29 - Graphs - I (38:46)
30 - Graphs - II (43:58)
31 - Graphs - III (37:58)
32 - Conclusions (31:23)

Important: Please enable javascript in your browser and download Adobe Flash player to view this site
Site Maintained by Web Studio, IIT Madras. Contact Webmaster: nptel@iitm.ac.in