CS 483
Fall 2008
Design and Analysis of Algorithms
12/01: Slides on Review are released.
11/24: Lecture note 9 (Chapter 8 of DPV) is released.
11/24: Assignment 8 is released.
11/10: Lecture note 8 (Chapter 7 of DPV) is released.
11/05: Assignment 7 is released.
11/03: Lecture note 7 (Chapter 6 of DPV) is released.
10/29: Assignment 6 is released.
10/27: Lecture note 6 (Chapter 5 of DPV) is released.
10/20: Please stop by to discuss your midterm before Oct. 31st.
10/20: Assignment 5 is released.
10/15: Tomorrow's class (Oct. 16th) is canceled.
10/06: Next Monday is a holiday. (Monday class meets Tuesday). Note midterm date (Tuesday, October 14th)!
10/01: Lecture note 5 is released.
09/24: Solutions of the first 3 assignments are posted.
09/24: Assignment 4 is released.
09/22: Lecture note 4 is released.
09/17: Assignment 3 is updated (with 2 more questions).
09/17: Solutions of the first 3 assignments will be given in class (September 24). Thus, late submission will not be accepted. Please inform your classmates.
09/17: Lecture note 3 is updated.
09/15: Assignmen 3 is released.
09/08: Assignment 2 due date is changed.
09/03: Assignment 2 is released.
08/27: Assignment 1 is released.
08/27: There is no class on September 1st (Labor Day).
08/26: Cynthia's office hour is changed to 5:00pm - 7:00pm, Tuesday.
08/25: Cynthia's office is Room 330, ST II.
07/31: Note new textbooks.
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. 25 | Introduction | DPV 0 | Lecture note 1 | ||
| 2 | Aug. 27 | Algorithms with numbers | DPV 1.1 - 1.3 | Assignment 1 | Lecture note 2 | |
| Sep. 1 | No class. Labor Day | |||||
| 3 | Sep. 3 | Algorithms with numbers | DPV 1.4 - 1.5 | Assignment 2 | Assignment 1 due Examples in class | |
| 4 | Sep. 8 | Randomized analysis | CLSR 5 | Lecture note 3 | ||
| 5 | Sep. 10 | Randomized analysis | CLSR 5 | |||
| 6 | Sep. 15 | Randomized analysis | CLSR 5 | Assignment 3 | Assignment 2 due | |
| 7 | Sep. 17 | Divide and conquer | DPV 2.1 - 2.4 | Lecture note 4 | ||
| 8 | Sep. 22 | Divide and conquer | DPV 2.5 - 2.6 | |||
| 9 | Sep. 24 | Review | Assignment 4 | Assignment 3 due Assignment solutions (1 - 3) | ||
| 10 | Sep. 29 | Divide and conquer | DPV 2.5 - 2.6 | |||
| 11 | Oct. 1 | DFS and SCC | DPV 3 | Lecture note 5 | ||
| 12 | Oct. 6 | BFS and Dijkstra | DPV 4.1 - 4.5 | Lecture note 6 | ||
| 13 | Oct. 8 | Review | Assignment 4 due. Review includes homework solutions | |||
| Oct. 14 | Midterm |
Monday class meets Tuesday. DPV 0 - 4.3, CLSR 5 |
||||
| 14 | Oct. 15 | BFS and Dijkstra | DPV 4.1 - 4.5 | |||
| 15 | Oct. 20 | Shortest paths | DPV 4.6 - 4.7 | Assignment 5 | ||
| 16 | Oct. 22 | Greedy | DPV 5 | Lecture note 6 | ||
| 17 | Oct. 27 | Greedy | DPV 5 | |||
| 18 | Oct. 29 | Dynamic programming | DPV 6.1 - 6.5 | Assignment 6 | Assignment 5 due | |
| 19 | Nov. 3 | Dynamic programming | DPV 6.6 - 6.7 | Lecture note 7 | ||
| 20 | Nov. 5 | Dynamic programming --- review | Assignment 7 | Assignment 6 due | ||
| 21 | Nov. 10 | Linear programming | DPV 7.1 - 7.3 | |||
| 22 | Nov. 12 | Linear programming | DPV 7.4 - 7.7 | Lecture note 8 | ||
| 23 | Nov. 17 | NP-completeness | DPV 8 | |||
| 24 | Nov. 19 | NP-completeness reduction | DPV 8 | Assignment 7 due | ||
| 25 | Nov. 24 | Approximation algorithms | DPV 9.1 - 9.2 | Assignment 8 | Lecture note 9 | |
| Nov. 26 | No class. Thanksgiving. | |||||
| 26 | Dec. 1 | Approximation algorithms | DPV 9.3 | Review | ||
| 27 | Dec. 3 | Review | Assignment 8 due | |||
| Dec. 8 | No class. Reading days. | |||||
| Dec. 10 | Final exam |
Wednesday 1:30pm - 4:15pm. DPV 1 - 9, CLSR 5, 16, 17 |
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.