[COMS W4231] Analysis of Algorithms I
Departments: Computer Science
Professors: Claire Monteleoni, Clifford Stein, and Mihalis Yannakakis
You know how you imagined it would be supercool to actually learn algorithms from the S of CLRS? Well, its better than what you imagined.
If you want to learn algorithms from scratch, or just brush up the basics and then step into the more advanced Dynamic Programming / Graph algorithms, this is the class for you. Prof. Stein is extremely approachable, and very patient with the stupidest of questions. He will not take any Math background for granted. First few lectures can be boring if you know Big-Oh but he is really wonderful at motivating most of the "magic" behind the algorithms. Most of the assignments are difficult and you really want to get started as soon as they are out.
Midterm was not too bad, if you had solved the assignments on your own and the final was downright easy.
Overall, an extremely enjoyable class. Highly recommended.
Heavy: 7 assignments + 1 take home midterm + final
I took the class CSOR 4231 with Prof Yanakakis. Unless you are really stupid, do NOT take this class under this Professor. Granted, he has great credentials and has won a Knuth prize or two for his research. But at the end of the day, teaching a course is not the same as doing research and not everyone can do both well.
Instead of making the class interesting and explaining the background behind how algorithms should be designed and how they came to be, he just puts the algorithm on the board and makes a poor attempt at explaining it. Watch one lecture given by Stein on CVN and you will be inspired .. and sit for one lecture with this guy, and you will forget the little you knew before the class. His homeworks concentrate more on proving correctness than on designing algorithms and mapping problems to standard algorithms. It is a pity that a researcher of his caliber, does not have the ability or the inclination to make this class interesting. Believe me, you would be better off watching lectures on MIT OCW or stein's on CVN. You have been warned.
The workload is high and you would have to devote about 10-15 hours a week for this course. There are 6 homeworks, a mid-term and a final.
Prof Stein is a good prof w.r.t.knowledge but his academic policy is not foolproof or rather I can say has a lot of loopholes in it . On one hand he does not prefer people referring to the sources on the internet whereas on the other hand his TAs give full credit to those who discuss the sums . So copying verbatim under the name of discussion is prevalent but if someone wants to access wikipedia or any other internet source then it is not allowed . Also the policy of picking up individuals for violating the academic policy seems to be random as many copy cats do escape . Also both the professors of algorithms do not show the same honesty while following this highly controversial and confusing academic honesty policy
heavy with 7 assignments , midterm , final
I guess professor does not have experience in teaching. She is not able to properly deliver the lecture, she herself is confused most of the time. Its a wastage of time attending her lecture.
Its better to study by yourself from book as her lectures does not contain anything new.
When you ask her some doubt, you will find that doubt is still doubt.
Moreover, she is very harsh to the students, in short not at all student friendly. She even does not listen to the student's problems. Her grading is also very strict. I will suggest not to take this course under her.
.
I think Professor Stein teaches well. He understands the subject thoroughly as can be seen in his explanations. I haven't seen even one instance of a question he couldn't answer convincingly. He is helpful in office hours and will walk you through a problem if necessary.
The class is in the morning (9 am ) and it's possible you will sleep through some classes. But every class is worth going to (take coffee !) . I find Stein's explanations in class easier to understand that the book. Many a times I have gone back to my notes because the book seemed to complicate thing a trifle.
The load is fair, bordering on too much (7 homeworks, all lengthy). The (take home) midterm was a breeze if you attended class.
I think he's a good teacher who can explain things well, but attendance does drop at the end, as people see that a significant part of the course revisits Data Structures. I wanted to add that in Algorithms, he does not care whether the homework is handed in at the beginning or end of class (as opposed to his other class), and that undergrads are curved separately from the grads (the class is 80% graduate students).
7 Homeworks, take home midterm, final
Directory Data
| Dept/Subj | Directory Course | Professor | Year | Semester | Time | Section |
|---|


Gold
Silver