Department Seal Sandia Mountains

CS 361 Class Syllabus


Teaching Assistant

Meeting Times:

Course Description

From the cs dept web page: An introduction to data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics include 0( ) notation, recurrence relations and their solution, sorting, hash tables, priority queues, search trees (including at least one balanced tree structure), and basic graph representation and search. Course includes programming projects.
Prerequisite: 201, 251L, and Math 163L.


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

What you will learn


Administrivia on HWs

Notes on Grading Hws

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


Topics will likely include:

Course Assessment

Approximate weighting:


Assignment deadlines are strict: late homework will automatically receive a grade of zero, unless reasonable cause can be shown (which is easy for one, possible for two, and very hard for three or more!); no make-up.
Collaboration is encouraged on all of the homeworks although the solutions should be written up individually unless stated otherwise. Usual university policies for withdrawals, incompletes and academic honesty. Grades assigned at the end of the semester are final. You will not be able to do any extra credit projects, papers, etc. to change your grade.