George Mason University
DEPARTMENT OF COMPUTER SCIENCE
CS583 - Analysis of Algorithms - Spring 2018
T 4:30-7:10, IN 134
Prerequisites | Description | Readings | Syllabus | Grading | Late | Dates
TA and Instructions for Mailing List
This page last updated on 1/17/18.
703-993-1545
richards@gmu.edu (email should have "CS583" in the subject line)
Course office hours: TR, 10:30–1:30 or by appt.
Engineering Bldg 5320
PREREQUISITES :
Discrete Mathematics (in Math 125 or a similar course), and CS330 (and so CS211 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 :
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 Tuesday March 6.
The final is scheduled for May 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.
LATENESS:
Projects will be marked down 25% each week they are late.
TA OFFICE HOURS
TA: Indranil Banerjee, ibanerje@gmu.edu, mon 6-8, ENGR 4456
NO LAPTOPS, cell-phones, etc. (If you NEED a laptop for note-taking then speak to me.)