CS483 Analysis of Algorithms (Spring 2017)


  • Instructor: Amarda Shehu amarda\AT\gmu.edu
    Place and Time: Robinson Hall A111, MW 9:00-10:15 pm
    Instructor Office Hours: ENGR #4452, MW 1:30-2:30 pm
    TA Office Hours: Xiaosheng Li, ENGR #5321, W 3:00-5:00 pm


  • This course will offer students a set of techniques by which to design and analyze algorithms. The class will cover recurrence relations, probabilistic analysis, sorting algorithms, algorithms for order statistics, advanced data structures for searching and mapping, optimization algorithms and advanced analysis, and graph algorithms. The last few lectures of the class will be devoted to special topics, including NP-completeness and approximation algorithms.


  • Material will be disseminated in the form of lectures. Students will be tested on the comprehension of the basic material through a combination of quizzes, homeworks, and exams. All quizzes and exams are closed book. Up to two cheat sheets will be allowed. Extra credit will allow students that are interested in advanced topics and research to demonstrate their abilities. Extra credit will not account for more than 10% of the total grade of a homework or exam. No late deliverables will be accepted, except for rare documented special circumstances.


  • Upon completion of this course, students should be able to analyze and compare algorithms in terms of both time and space complexity, understand fundamental sorting, optimization, and graph algorithms, understand when and how to use advanced data structures, analyze the computability of a problem, reason algorithmically, and design efficient algorithms.

Grade Breakdown

  • Quizzes: 45% (~5% each) Homeworks: 10% (~5% each)
    Midterm Exam: 20%
    Final Exam: 25%