George Mason University 

DEPARTMENT OF COMPUTER SCIENCE

CS483 - Analysis of Algorithms - Spring 2021

Monday and Wednesday 3:00 - 4:15,  on-line 

Prerequisites | Description | Outcomes | Readings | Syllabus | Grading | Late | TA

Professor Dana Richards 

703-993-1545 

(Please prefix the subject of your email with CS483.) 

richards@gmu.edu 

Course office hours: Wednesday 4:00-5:00 or by appt.

Use email to ask questions primarily.

Engineering Building - Room 5320 

PREREQUISITES : 

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

DESCRIPTION : 

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

OUTCOMES: 

• An understanding of classical problems in Computer Science
• An understanding of classical algorithm design and analysis strategies
• An ability to analyze the computability of a problem
• Be able to design and analyze new algorithms to solve a computational problem
• An ability to reason algorithmically 

READINGS: 

• A. Levitin, Introduction to the Design and Analysis of Algorithms, 2012 third edition. 
• 
  

SYLLABUS: 

We will cover most of the book in order; time may not permit depth in later chapters. The pacing below is NOT rigid. The topics will be: 

• Week 1: Chapter 1
• Week 2: Chapters 2, 3
• Week 3: Chapter 4
• Week 4: Chapter 5.1
• Week 5: Chapter 5.2
• Week 6: Chapter 6
• Week 7: Chapter 7
• Week 8: Exam 1,  Chapter 8.1
• Week 9: Chapter. 8.2
• Week 10: Chapter 9.1
• Week 11: Chapter 9.2
• Week 12: Chapter 10
• Week 13: Chapter 11
• Week 14: Chapter 12
• Exam 2 (final): 
• 
  

GRADING :

Exams -- 70%

Program -- 30%

The two exams, the midterm and the final, each covers 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%.  

The first exam is tentatively scheduled for March 15.

The second exam is scheduled by the University for  May 3, 1:30-4:15.

All testing is closed book. However, you may use notes, subject to the following rules for exam note sheets: One sheet of notes, both sides, 8.5 x 11 inches. Creating these note sheets is part of the exam and must be your own work, although you may discuss with others your general strategy about what kinds of things to put on your note sheet. No photocopying of the textbook, though you may write out material from it verbatim. No copying of anyone else's notes, even by hand. You may use a computer for editing your own notes and print out the results. The sheet must be turned in with your exam. Violations of these rules for creating the notes is considered a violation of the Honor Code.

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

Exam dates might differ from the syllabus above, but any change will be announced.

There is to be NO group work on graded assignments.  Receiving direct contributions to the code that is submitted is considered a violation of the Honor Code. (See cs.gmu.edu/resources/honor-code for the GMU and Computer Science guidelines.)

LATENESS:

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

TA: 

Abhisekh Rana, arana6@gmu.edu, TF  2:30-4:00.  

Using Piazza is encouraged especially to interact with the TA.

HOWEVER I DO NOT USE PIAZZA.