CS 483
Spring 2012
Design and Analysis of Algorithms
Lecture Time:
Monday, 4:30 pm - 7:10 pm
Location: Robinson Hall B203
Course webpage:
http://www.cs.gmu.edu/~lifei/teaching/cs483_spring12
Credit: 3
Instructor: Fei
Li, Room 5326, Engineering Building, email: lifei@cs.gmu.edu
Office hours: Tuesday
4:00pm - 6:00pm
NEWS:
April 16 , 2012: Assignments 3 & 4 are released.
March 1, 2012: Midterm exam is rescheduled on March 26.
February 13, 2012: Assignment 2 is released.
February 7, 2012: Katherine ``Raven'' Russell's office hours are changed to Thursday 4:00pm - 6:00pm. The office is changed to Room 5321.
February 6, 2012: Fei Li's office hours are changed to Tuesday 4:00pm - 6:00pm.
January 30, 2012: Assignment 1 is released.
In this course, a thorough examination of several well-known techniques that are used for the design and analysis of efficient algorithms will be covered. Topics to be covered include theoretical measures of algorithm complexity, greedy algorithms, divide and conquer techniques, dynamic programming, graph algorithms, search strategies, and an introduction to the theory of NP-completeness.
CS 310 and CS 330 Calculus (MATH 113, 114, 213) and MATH 125. Please contact with the instructor if you are not sure.
Algorithm Design by Jon Kleinberg and Éva Tardos, Addison Wesley (2006).
Lecture
|
Date
|
Topic
|
Lecture
Notes
|
Scope
|
Assignments
|
Note
|
1
|
01/23/2012
|
Introduction
|
Chapter 1 |
Read Sections 1.1 - 1.3 |
||
2
|
01/30/2012 |
Algorithm
Analysis
|
Chapter 2 |
Assignment 1: Page 67, Exercise 3 (2 points) Page 68, Exercise 6 (2 points) Page 69, Exercise 8 (a) (1 point) |
Read
Sections 2.1 - 2.2, 2.4
- 2.6
|
|
3
|
02/06/2012
|
Graphs
|
Chapter 3 |
Read
Sections 3.1 - 3.5
|
||
4
|
02/13/2012
|
Greedy
Algorithms
|
Chapter
4
|
Assignment 2: Page 110, Exercise 10 (2 points) Page 112, Exercise 12 (2 points) Page 189, Exercise 3 (2 points) Page 190, Exercise 5 (2 points) |
Assignment 1 due Read Sections 4.1 - 4.5, |
|
5
|
02/20/2012
|
Greedy
Algorithms
|
Chapter
4
|
Read Sections 4.1 - 4.5, |
||
6
|
02/27/2012
|
Divide
and Conquer
|
Chapter
5
|
|||
7
|
03/05/2012
|
Divide and Conquer |
||||
03/12/2012
|
Spring
Break
|
|||||
8
|
03/19/2012
|
Minimum Spanning Tree Review |
Chapter
4.5
|
|||
9
|
03/26/2012
|
Midterm
Exam
|
||||
10
|
04/02/2012
|
Dynamic
Programming
|
Chapter
6
|
|||
11
|
04/09/2012
|
Dynamic Programming Randomized Algorithms |
|
|||
12
|
04/16/2012
|
Dynamic Programming Network Flow |
Chapter
7
|
Assignment 3: Page 312, Exercise 1 (3 points) Page 316, Exercise 5 (3 points) Find the shortest path from A to all other vertices in the following graph Graph (3 points) Assignment 4: |
||
13
|
04/23/2012
|
Network Flow Applications |
||||
14
|
04/30/2012
|
Review |
|
Assignment 3 due Assignment 4 due |
||
05/14/2012: 4:30pm - 7:15pm
|
Final
Exam
|
Topics:
Course Outcomes:
1. An understanding of classical problems in Computer Science
2. An understanding of classical algorithm design and analysis strategies
3. An ability to analyze the computability of a problem
4. Be able to design and analyze new algorithms to solve a computational problem
5. An ability to reason algorithmically
Tentative Grading:
Weekly assignments (45%)
Midterm Exam (20%)
Final Exam (35%)
The integrity of the University community is affected by the individual choices made by each of us. GMU has an Honor Code with clear guidelines regarding academic integrity. Three fundamental and rather simple principles to follow at all times are that: (1) all work submitted be your own; (2) when using the work or ideas of others, including fellow students, give full credit through accurate citations; and (3) if you are uncertain about the ground rules on a particular assignment, ask for clarification. No grade is important enough to justify academic misconduct.
Plagiarism means using the exact words, opinions, or factual information from another person without giving the person credit. Writers give credit through accepted documentation styles, such as parenthetical citation, footnotes, or endnotes. Paraphrased material must also be cited, using MLA or APA format. A simple listing of books or articles is not sufficient. Plagiarism is the equivalent of intellectual robbery and cannot be tolerated in the academic setting. If you have any doubts about what constitutes plagiarism, please see me.
Disability Statement:
If you have a learning or physical difference that may affect your academic work, you will need to furnish appropriate documentation to the Disability Resource Center. If you qualify for accommodation, the DRC staff will give you a form detailing appropriate accommodations for your instructor.
In addition to providing your professors with the appropriate form, please take the initiative to discuss accommodation with them at the beginning of the semester and as needed during the term. Because of the range of learning differences, faculty members need to learn from you the most effective ways to assist you. If you have contacted the Disability Resource Center and are waiting to hear from a counselor, please tell me.