Design and Analysis of Algorithms (Web Course)

Lecture list: 1. Prof. Abhiram G. Ranade Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai, Mumbai 400 076 Email : ranade@cse.iitb.ac.in Telephone : (91-22) 2576 7734 (Office)

2. Prof. Ajit A. Diwan Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai, Mumbai 400 076 Email : aad@cse.iitb.ac.in Telephone : (91-22) 2576 7720 (Office)

3. Prof. Sundar Vishwanathan Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai, Mumbai 400 076 Email : sundar@cse.iitb.ac.in Telephone : (91-22) 2576 7727 (Office)

Detailed Syllabus:

Introduction Euclid's algorithm Problem, Instance, RAM model, RAM model 2: Asymptotic complexity Some stylistic issues Analysis of Algorithms

Principles of Algorithm Design Finding Maximum and Minimum Divide and conquer Introduction, Sorting Median Finding Dynamic Programming Combinatorial Search: Dynamic programming 1: Knapsack DP 2: Longest common subsequence DP 3: Matrix chain multiplication or Optimal search trees DP 4: A machine scheduling problem Greedy Algorithms Introduction Set of Intervals Fractional Knapsack Huffman Coding NP-Completeness Matching Introduction to NP-Complete Search/Decision SAT Independent_Set 3VC Exact Cover Multi Set Subset Sum & Partition Hamiltonian Circuit