Department Seal Sandia Mountains

CS 561 Class Syllabus

Course Web Page

Contact Info for Instructor and TA, office hours, assignments, tests, and general information is all on the course web page at

Course Description

From the CS dept web page: The study of data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics include: amortized analysis and self-adjusting data structures for trees and priority queues; algorithms on graphs, and greedy and divide and conquer paradigms


Our text is Introduction to Algorithms, second edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. This book is the "bible" for algorithm design and analysis.

What you should know

There are no specific prerequisites for this graduate class. However, I will assume a mathematical maturity including a familiarity with proof techniques similar to what is covered in CS261 and any mathematics classes beyond introductory calculus.


Notes on Grading Hws

Your hws and test answers should have the following properties. We will be looking for these when we grade:


Topics will likely include:

Course Assessment

Approximate weighting:


Grades assigned at the end of the semester are final. You will not be able to do any additional projects, papers, etc. to change your grade.