George Mason University 


CS583 - Analysis of Algorithms - Spring 2011

T 4:30-7:10, Arts Building 2003 

Prerequisites | Description | Readings | Syllabus | Grading | Late | Dates

TA and Instructions for Mailing List

This page last updated on 1/11/12. 

Professor Dana Richards 

703-993-1545 (email should have "CS583" in the subject line

Course office hours: TR, 11:00--12:00 or by appt.

Engineering Bldg 5320 


Discrete Mathematics (in Math 125 or a similar course), and CS330 (and so CS211 and elementary data structures). 


Introduction to a variety of algorithms which illustrate principles for both the design and analysis of efficient algorithms. 



The pace is approximate. 


Exams -- 70%

Program -- 30%

The two exams, the midterm and the final, each cover about a half of the semester; i.e., the final is not cumulative. 

Of these exams the highest score will count 40% and the lowest 30%. 

Late work and missed exams will not be allowed without an official university excuse. 

The midterm date will be announced; it is tentatively scheduled for Oct 13. 

The final is scheduled for Dec 15. 

The program will involve coding and comparing relatively simple algorithms from journal papers. 

Work may be done on any platform and in any algorithmic language you choose. 

There is to be NO group work on the program; violations will be considered Honor Code offenses.


Projects will be marked down 25% each week they are late. 


TA's name: tba

Office: tba

Office Hours: tba

Email: tba

Back to the top.

NO LAPTOPS, etc. (If you NEED a laptop for note-taking then speak to me.)