George Mason University 

DEPARTMENT OF COMPUTER SCIENCE

CS483 / CS583 - Analysis of Algorithms - Summer 2008


MTWR 9:30-11:45, IN 133 



Professor Dana Richards 

703-993-1545 


richards@cs.gmu.edu (email should have "CS583" in the subject line



Course office hours: TW, 2:00-3:00 or by appt.

Sci&Tech II Room 425 



PREREQUISITES : 


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



DESCRIPTION : 


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



READINGS: 




SYLLABUS: 


The pace is approximate. 




GRADING : 


Undergraduate:

Exams -- 100%

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 60% and the lowest 40%. 


Graduate:

Exams -- 80%

Program -- 20%

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 45% and the lowest 35%. 


The final is scheduled for Thursday, June 19; June 18th is a reading day; May 26 is holiday. 


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


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.


LATENESS: 


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


TA OFFICE HOURS 


TA's name: tba

Office: tba

Office Hours: tba

Email: 

Back to the top.