Design and Analysis of Algorithms (Web Course ... - E-Courses
Design and Analysis of Algorithms (Web Course ... - E-Courses Design and Analysis of Algorithms (Web Course ... - E-Courses
Design and Analysis of Algorithms (Web Course) Lecture list: Detailed Syllabus: Introduction Euclid's algorithm Problem, Instance, RAM model, RAM model 2: Asymptotic complexity Some stylistic issues Analysis of Algorithms 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)
<strong>Design</strong> <strong>and</strong> <strong>Analysis</strong> <strong>of</strong> <strong>Algorithms</strong> (<strong>Web</strong> <strong>Course</strong>)<br />
Lecture list:<br />
Detailed Syllabus:<br />
Introduction<br />
Euclid's algorithm<br />
Problem, Instance, RAM model,<br />
RAM model 2:<br />
Asymptotic complexity<br />
Some stylistic issues<br />
<strong>Analysis</strong> <strong>of</strong> <strong>Algorithms</strong><br />
1. Pr<strong>of</strong>. Abhiram G. Ranade<br />
Department <strong>of</strong> Computer Science <strong>and</strong> Engineering<br />
Indian Institute <strong>of</strong> Technology Bombay<br />
Powai, Mumbai 400 076<br />
Email : ranade@cse.iitb.ac.in<br />
Telephone : (91-22) 2576 7734 (Office)<br />
2. Pr<strong>of</strong>. Ajit A. Diwan<br />
Department <strong>of</strong> Computer Science <strong>and</strong> Engineering<br />
Indian Institute <strong>of</strong> Technology Bombay<br />
Powai, Mumbai 400 076<br />
Email : aad@cse.iitb.ac.in<br />
Telephone : (91-22) 2576 7720 (Office)<br />
3. Pr<strong>of</strong>. Sundar Vishwanathan<br />
Department <strong>of</strong> Computer Science <strong>and</strong> Engineering<br />
Indian Institute <strong>of</strong> Technology Bombay<br />
Powai, Mumbai 400 076<br />
Email : sundar@cse.iitb.ac.in<br />
Telephone : (91-22) 2576 7727 (Office)
Principles <strong>of</strong> Algorithm <strong>Design</strong><br />
Finding Maximum <strong>and</strong> Minimum<br />
Divide <strong>and</strong> conquer<br />
Introduction, Sorting<br />
Median Finding<br />
Dynamic Programming<br />
Combinatorial Search:<br />
Dynamic programming 1: Knapsack<br />
DP 2: Longest common subsequence<br />
DP 3: Matrix chain multiplication or Optimal search trees<br />
DP 4: A machine scheduling problem<br />
Greedy <strong>Algorithms</strong><br />
Introduction<br />
Set <strong>of</strong> Intervals<br />
Fractional Knapsack<br />
Huffman Coding<br />
NP-Completeness<br />
Matching<br />
Introduction to NP-Complete<br />
Search/Decision<br />
SAT<br />
Independent_Set<br />
3VC<br />
Exact Cover<br />
Multi Set<br />
Subset Sum & Partition<br />
Hamiltonian Circuit
Change language