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.