CS 483
Fall 2009
Design and Analysis of Algorithms
11/23/09: Reading material is linked.
11/18/09: Assignment 6 is posted.
11/11/09: Lecture 7 is posted.
11/04/09: Assignment 5 is posted.
10/28/09: Lecture 6 is posted.
10/21/09: Assignment 4 is posted.
10/19/09: Lecture 5 is posted.
09/28/09: Assignment 3 is posted.
09/23/09: Lecture 4 is posted.
09/21/09: Assignment 2 is posted.
09/21/09: Lecture 3 is posted.
09/10/09: Assignment 1 due date is postponed to 09/16/09, Wednesday.
09/03/09: Lecture 2 is posted.
09/02/09: Assignment 1 is posted.
08/31/09: Lecture 0 is posted.
08/30/09: Lecture notes will be posted on this website after each class.
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, sorting and selection algorithms, greedy algorithms, divide and conquer techniques, dynamic programming, linear programming, graph algorithms, search strategies, and an introduction to the theory of NP-completeness, algorithms for algebraic problems, probabilistic methods, and approximation algorithms.
CS 310 and CS 330 Calculus (MATH 113, 114, 213) and MATH 125. Please contact with the instructor if you are not sure.
Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, The McGraw-Hill Companies (2008). A draft of the book can be found at http://www.cs.berkeley.edu/~vazirani/algorithms.html
Highly Recommended Textbook:
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, The McGraw-Hill Companies, 2nd Edition (2001).
| Lecture | Date | Topic | Lecture Notes | Scope | Assignments | Note |
| 1 | Aug. 31 | Introduction | Lecture 0 | Chapter 0.2 - 0.3 of DPV | ||
| 2 | Sep. 2 | Divide and Conquer | Lecture 2 | Chapter 2.2 - 2.5 of DPV | Assignment
1
Page 8: exercise 0.1 (c), (f), (g), (j), (k), exercise 0.2. Page 71: exercise 2.3, exercise 2.5 (b), (f), (i), (k) |
|
| Sep. 7 | No class. Labor Day | |||||
| 3 | Sep. 9 | Divide and Conquer | ||||
| 4 | Sep. 14 | Divide and Conquer | ||||
| 5 | Sep. 16 | DFS and SCC | Lecture 3 | Chapter 3.2 - 3.4 of DPV | Assignment 1 due | |
| 6 | Sep. 21 | DFS and SCC | Assignment
2
Page 95: exercise 3.2, 3.3 Page 96: exercise 3.4 (ii), 3.7 Page 97: exercise 3.11 Page 98: exercise 3.16 |
|||
| 7 | Sep. 23 | BFS and Dijkstra | Lecture 4 | Chapter 4.1 - 4.4, 4.6, 4.7 of DPV | ||
| 8 | Sep. 28 | BFS and Dijkstra | ||||
| 9 | Sep. 30 | BFS and Dijkstra | Assignment 3
Page 120: exercise 4.1, 4.2, 4.3 Page 121: exercise 4.5, 4.8, 4.12 Page 124: exercise 4.18 Page 125: exercise 4.21 |
Assignment 2 due | ||
| 10 | Oct. 5 | Shortest Path | ||||
| 11 | Oct. 7 | Shortest Path | ||||
| Oct. 12 | No class. Columbus Day | |||||
| 12 | Oct. 13 | Review (Chapters 2 - 4) | Monday class meets Tuesday | |||
| 13 | Oct. 14 | Midterm |
Assignment 3 due |
|||
| 14 | Oct. 19 | Greedy Algorithms | Lecture 5 | Chapter 5 of DPV | ||
| 15 | Oct. 21 | Greedy Algorithms | Assignment
4
Page 148: exercise 5.1, 5.2, 5.5 Page 149: exercise 5.7, 5.9 Page 150: exercise 5.13, 5.14 Page 153: exercise 5.28 |
|||
| 16 | Oct. 26 | Greedy Algorithms | ||||
| 17 | Oct. 28 | Dynamic Programming | Chapter 6 of DPV | |||
| 18 | Nov. 2 | Dynamic Programming | Assignment 4 due | |||
| 19 | Nov. 4 | Dynamic Programming | Assignment
5
Page 177: exercise 6.1, 6.2 Page 178: exercise 6.3 Page 179: exercise 6.7 Page 180: exercise 6.11 |
|||
| 20 | Nov. 9 | Dynamic Programming | ||||
| 21 | Nov. 11 | Linear Programming |
Chapter 7.1 - 7.4, 7.6, 7.7 of DPV |
|||
| 22 | Nov. 16 | Linear Programming | ||||
| 23 | Nov. 18 | Linear Programming | Assignment 6
Page 222: exercise 7.1 Page 223: exercise 7.2 Page 223: exercise 7.5 Page 226: exercise 7.17 (a), (b), (c), (d). You do not need to give the minimum cut for (a). |
Assignment 5 due | ||
| 24 | Nov. 23 | Linear Programming | Reading | |||
| Nov. 25 | No class. Thanksgiving. | |||||
| 25 | Nov. 30 | NP-Completeness | Chapter 8 of DPV | Assignment 6 due | ||
| 26 | Dec. 2 | A guest lecture | ||||
| 27 | Dec. 7 | Review (Chapters 5 - 8) | ||||
| 28 | Dec. 9 | No class. Reading days. | ||||
| 29 | Dec. 14 | Final exam |
1:45 pm – 4:15 pm |
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.