CS 325 – Algorithms

CS 325 was the first CS course that I taught at Oregon State. Aside from a long and strong review of proof techniques, I chose to include 6 major topics:  divide and conquer algorithms, randomized algorithms, dynamic programming, linear programming, complexity, and approximation algorithms.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s