Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
courses:2019:cs503 [2019/08/10 08:47]
arijit [Lectures]
courses:2019:cs503 [2019/08/20 11:41]
arijit
Line 17: Line 17:
   * Week 1: Analysis of algorithms, Finding max, average case analysis, Finding skyline   * Week 1: Analysis of algorithms, Finding max, average case analysis, Finding skyline
   * Week 2: Towers of Hanoi and its variant, Fibonacci numbers, Karatsuba algorithm for multiplication,​ FFT   * Week 2: Towers of Hanoi and its variant, Fibonacci numbers, Karatsuba algorithm for multiplication,​ FFT
-  * Week 3: FFT, +  * Week 3: FFT, State space exploration,​ Dynamic Programing - weighted interval scheduling¬†
 +  * Week 4: Dynamic programming - segmented least square,¬†
 +  * Week 5:
  
   ​   ​
   ​   ​
 =====Other information===== =====Other information=====
 +  * [[:​courses:​2019:​cs503:​term_paper|Paper presentation]]