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

 
Prof. Kamalika Datta
National Institute of Technology Meghalaya

 

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.


Modules

Topics

1

Time Complexity, Insertion Sort, Merge Sort.

2

Divide and Conquer

3

QuickSort, HeapSort

4

Linear-time Sorting

5

Order Statistics & Hashing

6

Balanced Binary Serach Tree

7

Augmenting Data Structures & Computational Geometry

8

Dynamic Programming Problems & Graphs

9

Shortest Path Problem

10

All-pairs Shortest Paths, BFS & DFS

11

Fixed-Universe Successor problem & Amortized Algorithms

12

Network Flow, NP problems

B.E/B.Tech,B.Sc,M.Sc,

1. D.A. Patterson and J.L. Hennessy, Computer Architecture: A Quantitative Approach, 5/E, Morgan Koffman, 2011.
2. D.A. Patterson and J.L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 5/E, Elsevier India, 2016.
3. W. Stallings, Computer Organization and Architecture: Designing for Performance, Pearson, 2015.
4. C. Hamacher, Z. Vranesic and S. Zaky, Computer Organization, 5/E, McGraw Hill, 2011. 5.
5. J.P. Hayes, Computer Architecture and Organization, 3/E, McGraw Hill, 1998.

Nil

Nil

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