This class is very difficult, especially if you struggle with broader computer science concepts like me. The homeworks especially can be brutal and time-consuming, often involving multiple hours of working with TAs and fellow students to get a better understanding of the key concepts.

The content was actually pretty interesting and useful (especially for technical interviews), but is difficult to fully digest and understand. Concepts include greedy algorithms, dynamic programming, NP problems, algorithm runtime analysis, and more.

Prof. Valiant was a good lecturer, but I wish there had been more study materials provided for the exams, since they were often very difficult. The structure of the class was strange too - no official office hours were offered, and an emphasis was put on peer collaboration, which was nice to bounce ideas off each other, but frustrating when you were stuck with a concept and needed aid from a TA.

Start the homeworks as early as possible, they are time-consuming! Same thing with the exams - begin studying early and often. Ask for clarification on concepts when you need it, instead of waiting until you're completely lost.

A very very difficult class, but one that I found very useful. Helped me prepare alot for interview questions, and getting a much better idea of what theory and research looks like in Computer Science. Homeworks and Exams were really hard, and a good bit of work, but I felt like it was very worth it.

Looks at many algorithm development paradigms like Divide and Conquer, Dynamic Programming, Greedy Algorithms etc., how to create algorithms, and prove their correctness and runtime, as well as reductions between problems in NP.

Professor Psomas did a great job making the difficult content more easily understood, and did a good job trying to keep lectures interesting. Very reasonable with homework deadlines and seemed like an approachable guy.