Syllabus  |   Lectures  |   Downloads  |   FAQ  |   Ask a question  |  
Course Co-ordinated by IIT Kharagpur
Coordinators
 
Prof.Sourav Mukhopadhyay
IIT Kharagpur

 

Download Syllabus in PDF format



Untitled Document
 
This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.
 

Week. No

Topics

1.

Insertion Sort, Asymptotic Notation, Merge Sort, QuickSort, Divide and Conquer

2.

Heap Sort, Linear-time Sorting, Order Statistics

3.

Hashing, BST Sort, Augmenting Data Structures, Dynamic Programming

4.

Graphs : BFS, DFS, Prim's, Shortest Paths
Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 3rd ed.

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