📌 Course Contents What one would expect from a course in algorithms. A heavy focus is initially put on solving problems via induction, while the latter part covers graph algorithms, DP and NP-completness.
📌 Teaching Method 3 hour lectures
📌 Course Materials Lecture notes, powerpoint and referenced chapter in the literature for each lecture.
📌 Assignments and Exams Homework every week, midterm and final.
📌 Grading On the above.
📌 Reviews & Feedback Overall a decent algorithms course, where the basics were covered. One could perhaps prefer more programming in the course, since only 2 out of 10 homeworks were programming assignments. The assignments were also surprisingly time consuming and tricky, and the midterm and final exam contained 10 decently time consuming questions in 3 hours, which made it hard to answer all. The average on the midterm where around 50%, which might reflect that fact.
📌 Course Materials should be a little more up to date
📌 Assignments and Exams hard
📌 Reviews & Feedback Although the course belongs to the IM department, the students who take the course are as familiar with the algorithm as a CSIE student. I think the course materials were the biggest problem in this course. Since a very old book was followed, it was impossible to learn something from other sources. Because the algorithms are usually very different. Homework is really time consuming and there are questions that are hard to understand. Exams are usually similar to homework, but this does not make it easy, on the contrary, it makes it difficult :)