Course description – The course is a successor to the data structures and algorithms course. Students are expected to have completed CS213 before taking this course. The course teaches the most important techniques of algorithm design – Dynamic Programming, Greedy Algorithms, and Divide and Conquer. These algorithm design techniques occur almost everywhere in Computer Science.
Course pattern and logistics – There are 3 quizzes and the best 2 of the 3 are taken for final grading. Besides, there is a midsem and an endsem and a couple of programming assignments. Weightages depend on the instructor.
Comments on the instructor – Professor Abhiram Ranade takes this course. He is an excellent instructor. The best thing about him is that he goes slow enough to ensure that even the slowest student of the class follows the topic. He tries his best to keep the course light. He has also introduced programming assignments in the course to make it more interesting and challenging.
Who will find it interesting – Of course the course is compulsory for all CSE students. Those non-CSE students who want a career in Computer Science must definitely take this course. The course will help them to do well in technical interviews. It will also help them to develop better foundations in the Computer Science domain.
No comments:
Post a Comment