Syllabus  |   Lectures  |   Downloads
Course Co-ordinated by IIT Kharagpur
Coordinators
 
Dr. P.P.Chakraborty
IIT Kharagpur

 

Untitled Document

This course covers lessons in C programming,data structures,merge sort and quick sort,strings,arrays , linked lists and graphs.

   

S.No

Topic

1

Introduction

2

C Programming - I

3

C Programming - II

4

C Programming - III

5

Data Structuring: Case Study - I

6

Data Structuring: Case Study - II

7

Data Structuring: Case Study - III

8

Problem Decomposition By Recursion - I

9

Problem Decomposition By Recursion - II

10

Problem Decomposition By Recursion - III

11

Merge sort And Quick sort

12

Characters And Strings

13

Arrays: Addresses And Contents

14

Structures - I

15

Structures - II

16

Dynamic Allocation Part - I

17

Linked Lists - I

18

Complexity (Efficiency) of Algorithms

19

Asymptotic Growth Functions

20

Asymptotic Analysis of Algorithms

21

Data Structuring

22

Search Trees

23

Search Trees - II

24

Search Trees - III

25

2-3 Trees

26

Algorithm Design - I

27

Algorithm Design - II

28

Algorithm Design - III

29

Graphs - I

30

Graphs - II

31

Graphs - III

32

Conclusions

   
Under development

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