1
Programming Methodology and Data Structures. Instructor: Dr. P. P. Chakraborty, Department of Computer Science and Engineering, IIT Kharagpur.
861 years
31
The two aspects - programming methodology and data structures - are quite integrated in nature. The issue at hand in most tasks of computer science is the issue of problems solving. Unless we understand how to solve problems on a computer quite efficiently and what are the steps to do it, it will be very difficult to understand what programming methodology and data structuring means because these are two derived items of the system of problem solving. This course covers lessons in C programming, data structures, merge sort and quick sort, strings, arrays, linked lists, search trees, algorithm design and graphs. (from nptel.ac.in)
Course Currilcum
- Lecture 01 – Introduction Unlimited
- Lecture 02 – C Programming I Unlimited
- Lecture 03 – C Programming II Unlimited
- Lecture 04 – C Programming III Unlimited
- Lecture 05 – Data Structuring: Case Study I Unlimited
- Lecture 06 – Data Structuring: Case Study II Unlimited
- Lecture 07 – Data Structuring: Case Study III Unlimited
- Lecture 08 – Problem Decomposition by Recursion I Unlimited
- Lecture 09 – Problem Decomposition by Recursion II Unlimited
- Lecture 10 – Problem Decomposition by Recursion III Unlimited
- Lecture 11 – Mergesort and Quicksort Unlimited
- Lecture 12 – Characters and Strings Unlimited
- Lecture 13 – Arrays: Addresses and Contents Unlimited
- Lecture 14 – Structures Unlimited
- Lecture 16 – Dynamic Allocation Unlimited
- Lecture 17 – Linked Lists Unlimited
- Lecture 18 – Complexity (Efficiency) of Algorithms Unlimited
- Lecture 19 – Asymptotic Growth Functions Unlimited
- Lecture 20 – Asymptotic Analysis of Algorithms Unlimited
- Lecture 21 – Data Structuring Unlimited
- Lecture 22 – Search Trees I Unlimited
- Lecture 23 – Search Trees II Unlimited
- Lecture 24 – Search Trees III Unlimited
- Lecture 25 – 2-3 Trees Unlimited
- Lecture 26 – Algorithm Design I Unlimited
- Lecture 27 – Algorithm Design II Unlimited
- Lecture 28 – Algorithm Design III Unlimited
- Lecture 29 – Graphs I Unlimited
- Lecture 30 – Graphs II Unlimited
- Lecture 31 – Graphs III Unlimited
- Lecture 32 – Conclusions Unlimited
