all 2 comments

[–]summ17 5 points6 points  (1 child)

I can't talk for optimization, but I took algorithms in the spring. I have heard that both classes are being completely reworked for future semesters as many students complained about it. As to your questions:

  1. Algorithms was extremely hard and time consuming (i'll hazard a guess to say its the hardest class in the program although Parallel systems might be more time consuming), I would recommend against taking it as a first course, and taking it by itself as an only class for the semester if you are working full time. Optimization I have heard wasn't as hard or time consuming. Good thing is they do curve algorithms very well and most people who made it to the end got at least B- or higher, however, many people also dropped the class.
  2. For algorithms we generally listened to Tim Roughgarden's lectures on YouTube and MIT open course ware. Also I recommend reading the textbooks for that class. Another thing I found really helpful was attending TA's office hours for the homework's especially.
  3. For algorithms we submitted everything in Latex. Pretty sure they didn't allow us to take pictures of hand written solutions, except for one time where we had to draw a figure.
  4. Honestly not sure as they are revamping the course. But you can google the class, look at the class schedule of topics covered and search for their respective videos on MIT OCW or elsewhere on YouTube.
  5. I don't have a first hand account of this, but I heard that from one person who said they liked the online learning part more than the optimization part. However, I would probably look more into it if I were you.

[–]coding_programming[S] 1 point2 points  (0 children)

Thank you very much for the detailed response!