## IT700

### Course Name:

Advanced Algorithms (IT700)

### Programme:

### Semester:

### Category:

### Credits (L-T-P):

### Content:

Review of algorithm analysis. Stable Matching Problem, Algorithm design techniques: recursion, branch-and-bound, divide and conquer, greedy, dynamic programming; integer linear programming; polynomial and matrix multiplications: Fast Fourier Transforms (FFT), FFT Algorithms, Amortized analysis, Advanced Data Structures to implement Disjoint Sets, Priority Queues and other Dynamic Sets. Randomized algorithms to solve fundamental problems like sorting, MST, min-cuts, geometric problems, caching, load balancing, etc. Reductions and theory of NP-complete problems, Approximation algorithms, Local Search heuristics and On-line algorithms.