CS 483
Data Structures and Analysis of Algorithms
Section 1


Time/Location:  Wednesday 7:20-10pm  B105  Teaching Assistant: Jiang Wang, Jian Cui
Instructor: Jana Kosecka  jwang@gmu.edu,  jcui@gmu.edu
Office hours:    Wednesday 2-4 pm  Office hours: 
Contact: Office 417 ST2, kosecka@gmu.edu, 3-1876   Monday 5-7pm Jian Cui
 Thurs  5-7pm Jiang Wang
Course web page: http://www.cs.gmu.edu/~kosecka/cs483.html   Office:  Room 365 ST2

Course Scope: 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 covered include theoretical measures of algorithm complexity, sorting and selection algorithms, greedy algorithms, divide and conquer techniques, dynamic programming, graph algorithms, search strategies, and an introduction to the theory of NP-completeness. Additional topics may be covered if time permits. Students are expected to have taken prior undergraduate courses in data structures and algorithms, as well as calculus and discrete mathematics.

Prerequisites:
CS 310 and CS 330 Calculus (MATH 113, 114, 213) and MATH 125

Required Textbook:
Cormen, Leiserson & Rivest, Introduction to Algorithms, McGraw Hill, 1990

Course Requirements, Grading and Policies:
There will be a midterm examination, several practice homework assignments and a comprehensive final examination.

All required assignments must be completed by the stated due date and time. There will be absolutely no extensions for the homeworks (not even in the case of emergency).  Your lowest homework grade will not be counted towards your final grade.

Please note that all coursework is to be done independently. Cheating on the homeworks will be penalized by maximum
negative credit and cheating on the exam will earn you an F in the course. See the GMU Honor Code System and Policies at http://www.gmu.edu/catalog/acadpol.html and http://www.cs.gmu.edu/honor-code.html.
You are encouraged  to discuss the material BEFORE you do the assignment.  As a part of the interaction  you can
discuss a meaning of the question or possible ways of approaching the solution. The homework should be written stricly
by yourself. In case your solution is based on the important idea of someone else please acknowledge that in your solution,
to avoid any accusations.

Grading:
Homeworks 40% (about every week)
Midterm  30%
Final Exam  30%

Important Dates:
Exam 1 -  October 24th  (in class)
Exam 2 - tba (in class)

Tentative List of Topics: