# click the upper-left icon to select videos from the playlist
source: nptelhrd 2010年5月19日
Computer Sc - Programming and Data Structure by Dr. P. P. Chakraborty, Department of Computer Science and Engineering, IIT Kharagpur.
Lec-1 Introduction 35:59
Lec-2 C Programming-I 34:58
Lec-3 C Programming-II 47:13
Lec-4 C Programming-III 36:27
Lec-5 Data Structuring: Case Study-I 46:54
Lec-6 Data Structuring: Case Study-II 34:27
Lec-7 Data Structuring: Case Study-III 39:52
Lec-8 Problem Decomposition By Recursion-I 42:58
Lec-9 Problem Decomposition By Recursion-II 41:58
Lec-10 Problem Decomposition By Recursion-III 32:20
Lec-11 Mergesort And Quicksort 43:32
Lec-12 Characters And Strings 42:36
Lec-13 Arrays: Addresses And Contents 34:16
Lec-14 Structures-I 35:51
Lec-15 Structures-II 32:33
Lec-16 Dynamic Allocation Part-I 37:02
Lec-17 Linked Lists-I 42:09
Lec-18 Complexity(Efficiency) of Algorithms 35:09
Lec-19 Asymptotic Growth Functions 43:15
Lec-20 Asymptotic Analysis of Algorithms 36:46
Lec-21 Data Structuring 44:03
Lec-22 Search Trees 42:22
Lec-23 Search Trees-II 41:05
Lec-24 Search Trees-III 37:57
Lec-25 2-3 Trees 41:31
Lec-26 Algorithm Design-I 37:32
Lec-27 Algorithm Design-II 29:40
Lec-28 Algorithm Design-III 38:17
Lec-29 Graphs-I 38:47
Lec-30 Graphs-II 43:58
Lec-31 Graphs-III 37:58
Lec-32 Conclusions 31:23
1. Clicking ▼&► to (un)fold the tree menu may facilitate locating what you want to find. 2. Videos embedded here do not necessarily represent my viewpoints or preferences. 3. This is just one of my several websites. Please click the category-tags below these two lines to go to each independent website.
No comments:
Post a Comment