InfoCoBuild

Programming Methodology and Data Structures

Programming Methodology and Data Structures. Instructor: Dr. P. P. Chakraborty, Department of Computer Science and Engineering, IIT Kharagpur. 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)

Lecture 11 - Mergesort and Quicksort


Go to the Course Home or watch other lectures:

Lecture 01 - Introduction
Lecture 02 - C Programming I
Lecture 03 - C Programming II
Lecture 04 - C Programming III
Lecture 05 - Data Structuring: Case Study I
Lecture 06 - Data Structuring: Case Study II
Lecture 07 - Data Structuring: Case Study III
Lecture 08 - Problem Decomposition by Recursion I
Lecture 09 - Problem Decomposition by Recursion II
Lecture 10 - Problem Decomposition by Recursion III
Lecture 11 - Mergesort and Quicksort
Lecture 12 - Characters and Strings
Lecture 13 - Arrays: Addresses and Contents
Lecture 14 - Structures
Lecture 15 - Structures (cont.)
Lecture 16 - Dynamic Allocation
Lecture 17 - Linked Lists
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 I
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