Welcome to Data Structures and Algorithms!

Printable Version

CS201 is a undergraduate level course concerning the analysis of algorithms. Topics include, but are not limited to, the growth of functions, recurrences, order statistics, self-correcting data structures, amortized analysis, graph algorithms, and NP-completeness.

Here are some useful links... A discussion forum has been established for this class. The forum is meant for free-for-all discussions. If someone asks a reasonable question and you know the answer, please respond. Always remember to be polite and respectful when you post.

It is required that you sign up for the CS201 forum and that you read all new postings daily, as I will use this forum for any emergency communications. Registrations will not be allowed after the fifth class meeting.