Instructor : Abhiram Ranade
Course Description : This course on algorithms covers various topics which include
- Framework for algorithm analysis, worst case and average case analysis
- Divide and Conquer technique
- Dynamic programming
- Greedy Algorithms
- NP hard and NP complete set of problems
- Reduction of one class of problems to another
Reference books - Algorithm design by Kleinberg & Tardos, Introduction to Algorithms by CLRS (cormen, leiserson, rivest, stein)
Logistics :
- Three hours of lectures per week
- Grading - 3 or 4 quizzes, midsem and endsem, few home assignments
- Closed notes/book examination
- Difficulty - 3/5
- No compulsory attendance, but prof expects everyone to attend classes.
Comments on Instructor : Instructor is very much interested in students learning and punctual. Proper study material will be made available by the instructor. His teaching will be done at a pace such that even a below par student will be able to grasp most of the things taught, however this makes some students feel that he goes on very slowly in covering the syllabus.
Who will find it interesting : Any student who found Data Structures (cs 213) course interesting, will most probably like this course. Also people who are interested in pursuing algorithm related research can find the area of their interest by the end of this course.
No comments:
Post a Comment