Course Description:

In this course, a thorough examination of several well-known techniques that are used for the design and analysis of algorithms will be covered. Topics to be studied include theoretical measures of algorithm complexity, sorting and selection algorithms, greedy algorithms, divide and conquer techniques, dynamic programming, graph algorithms, search strategies, randomized algorithms, and an introduction to the theory of NP-completeness.

Prerequisites:

CS 310 (Data Structures) and CS 330 (Formal Methods & Models)
MATH 125 (Discrete Mathematics)

---

Instructor:

Prof. Pearl Y. Wang
Computer Science Department
Office:  Nguyen Engineering - ENGR 4300
Tel:       703-993-1530
E-mail:    pwang at cs.gmu.edu
Office Hours:   Thurs 1 pm - 3 pm;   other times available by appointment

Teaching Assistant:

Xiaosheng Li
Email:   xli22 at gmu.edu
Office Hours:  Fridays 3 - 5 pm; other times by arrangement
Location:  Nguyen Engineering - Rm. 5321

Class Time & Location:

Sec 002: Thursdays 4:30 pm - 7:10 pm;   Robinson B 113

---

Required Textbook:

Kleinberg and Tardos, Algorithms Design, Pearson Education, 2006
     (This book is available at the Mason Bookstore and Mason Library.)

---

Course Requirements & Grading:

The course grade is based on your performance on required homework assignments, weekly quizzes, midterm, and comprehensive final examinations. All required coursework must be completed by the stated due date and time. Late coursework will not be accepted and make-up tests will not be given for missed examinations.

See the MyMason for all course information.

Homework	16%
Quizzes	24%
Midterm Exam	30%
Comprehensive Final Exam	30%

All students must work in groups on the Homework assignments. Groups will be assigned by the instructor and additional information related to group responsibilities and grading will be distributed in the first class.

All required quizzes and exams must be performed independently. Please read the information about GMU and CS Department Academic Integrity and Honor Code Policies at

http://cs.gmu.edu/resources/honor-code/.

These policies will be strictly enforced. Violations of Honor Code policies can result in a failing grade for the course.

If you have a documented learning disability or other condition that may affect academic performance you should: (1) make sure this documentation is on file with the Disability Services (SUB I, Suite 2500; 993-2474; http://ds.gmu.edu/) to determine the accommodations you need; and (2) talk with me to discuss your accommodation needs.

---

Important Dates:

Last day to add:  September 5, 2017
Last day to drop: September 5, 2017 (no tuition penalty)
Final day to drop: September 29, 2017

Columbus Day recess: October 9, 2017
Thanksgiving recess: November 22 - 26, 2017
Last day of classes: December 9, 2017

Final Examination: December 14, 2017, 4:30 pm - 7:15 pm

---

Tentative List of Topics:

You are expected to be familiar with the concepts taught in prerequisite courses.

Please see the Timetable for the more details.

Topic	Chapter(s)
Introduction	1 & 13.1
Basics of Algorithm Analysis	2
Graphs	3
Greedy Algorithms	4
Divide-and-Conquer	5
Dynamic Programming	6
Network Flows	7
NP-Completeness	8
Randomized Algorithms	13

---

Created: 28 Aug 2017
P.Y. Wang