CS G526-Handout
CS G526-Handout
In addition to part I (General Handout for all courses appended to the time table) this
portion gives further specific details regarding the course.
Course Description:
Randomized data structures, Algorithmic Design Techniques, Optimization
problems, hard problems, NP Class, NP Complete class, Examples of problems
belonging to NP Complete class, Reducibility, Approximation algorithms for NP
hard problems, Randomized Algorithms.
Objective
1. To introduce various algorithms design techniques to solve optimization
problems.
2. To introduce the notion of hard problems and the technique to prove
hardness of the problem.
3. Study approximation algorithm and randomized algorithms to solve hard
problems
Text Book
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein
Introduction to Algorithms
Third Edition, PHI Learning Private Limited, 2015
Reference Book
Rajeev Motwani & Prabhakar Raghavan
Randomized Algorithms
Cambridge University Press, 2000
Lecture Modules:
Lecture Schedule:
Components
Notice: All notices for this course will be posted on Google Classroom/Quanta page.
Instructor-in-Charge
CS G526