Programming and Data Structure


Lecture 1 - Introduction


Lecture 2 - C Programming - I


Lecture 3 - C Programming - II


Lecture 4 - C Programming - III


Lecture 5 - Data Structuring : Case Study - I


Lecture 6 - Data Structuring : Case Study - II


Lecture 7 - Data Structuring : Case Study - III


Lecture 8 - Problem Decomposition By Recursion - I


Lecture 9 - Problem Decomposition By Recursion - II


Lecture 10 - Problem Decomposition By Recursion - III


Lecture 11 - Merge sort And Quick sort


Lecture 12 - Characters And Strings


Lecture 13 - Arrays: Addresses And Contents


Lecture 14 - Structures - I


Lecture 15 - Structures - II


Lecture 16 - Dynamic Allocation Part - I


Lecture 17 - Linked Lists - I


Lecture 18 - Complexity (Efficiency) of Algorithms


Lecture 19 - Asymptotic Growth Functions


Lecture 20 - Asymptotic Analysis of Algorithms


Lecture 21 - Data Structuring


Lecture 22 - Search Trees


Lecture 23 - Search Trees - II


Lecture 24 - Search Trees - III


Lecture 25 - 2-3 Trees


Lecture 26 - Algorithm Design - I


Lecture 27 - Algorithm Design - II


Lecture 28 - Algorithm Design - III


Lecture 29 - Graphs - I


Lecture 30 - Graphs - II


Lecture 31 - Graphs - III


Lecture 32 - Conclusions