Lecture Time: Monday 7:20
pm - 10:00 pm
Location: Innovation Hall 206
Course webpage: http://www.cs.gmu.edu/~lifei/teaching/cs583_fall12
Credit: 3
Instructor: Fei Li, Room 5326, Engineering Building, email:
mailto:lifei@cs.gmu.edu
Office hours: Fridays 2:00pm 4:00pm
Teaching Assistant: Ermo Wei, Room 4456,
Engineering Building, email: mailto:'ewei@masonlive.gmu.edu'
Office hours: Thursdays 1:00pm 3:00pm
NEWS:
2012/12/11: Assignment 7s
solution is released.
2012/12/03: Assignment 7
is released. It is due in one week.
2012/11/26: Assignment 5s
solution is released.
2012/11/19: Assignment 6
is released. It is due in one week.
2012/11/19: Assignment 4s
solution is released.
2012/11/12: Assignment 5
is released. It is due in one week.
2012/11/05: Assignment 4
is released. It is due in one week.
2012/10/29: Class is
cancelled due to storm.
2012/10/01: Assignment 3
is released. It is due in one week.
2012/09/17: Assignment 2
is released. It is due in two weeks.
2012/09/11: Assignment 1
is updated. Its due date is updated. It is due in two weeks.
2012/09/10: Assignment 1
is released. It is due in one week.
No
class on September 3, 2012.
Dr.
Lis office hours are changed from Mondays 4:00pm 6:00pm to Fridays 2:00pm
4:00pm.
Lecture |
Date |
Topic |
Lecture
Notes |
Scope |
Assignments |
Note |
1 |
August 27 |
Introduction |
Appendix A Chapter 10 (read it by yourself) |
|||
Labor Day |
September 3 |
|
||||
2 |
September 10 |
Divide and Conquer |
Chapter 3 Chapter 4 |
Assignment 1: Page 39, Exercise 2.3-7 Page 41, Problem 2.4 Page 61, Problem 3-3 (select any 10
functions for comparison) You do not have to solve 3-3.(b) Page 75, Exercise 4.1-5 Page 107, Problem 4-1 Page 109, Problem 4-5 |
||
3 |
September 17 |
Probabilistic Analysis |
Wrap up Divide-and-Conquer |
Appendix C Chapter 5 |
Assignment 2: Page 117, Exercise 5.1-3 Page 122, Exercise 5.2-4 Page 122, Exercise 5.2-5 |
|
4 |
September 24 |
Sorting |
Wrap-up Probabilistic Analysis |
Chapter 6 Chapter 7 |
Assignment 1 Due |
|
5 |
October 1 |
Search |
Chapter 8 Chapter 9 Chapter 12 |
Assignment 3: Page 215, Exercise 9.1-1 Page 223, Exercise 9.3-8 Page 225, Problem 9-2 (a), (b), and
(c) |
Assignment 2 Due |
|
6 |
October 9 (Tuesday) |
Review |
|
Chapter 13 Chapter 14 |
Assignment 3 Due |
|
7 Midterm Exam |
October 15 |
|||||
8 |
October 22 |
Dynamic Programming |
Chapter 15 |
|||
Class cancelled due to
storm |
October 29 |
|
|
|||
9 |
November 5 |
Dynamic Programming |
Chapter 15 |
|||
10 |
November 12 |
Greedy Algorithms |
Chapter 16 |
Assignment 5: Page 428, Exercise 16.2-7 Page 447, Problem 16-2 |
Assignment 4 Due |
|
11 |
November 19 |
Amortized Analysis |
Chapter 17 |
Assignment 6: Page 458, Exercise 17.2-1 |
Assignment 5 Due |
|
12 |
November 26 |
Graph Traversals Minimum Spanning Tree |
Graph Traversals |
Chapter 22 Chapter 23 |
Assignment 6 Due |
|
13 |
December 3 |
Shortest Path |
Chapter 24 Chapter 25 |
Assignment 7: Page 679, Problem 24-3 Page 682, Problem 24-6
|
||
14 |
December 10 |
Maximum Flow Review |
Chapter 26 |
|
Assignment 7 Due |
|
Final exam |
December 17 7:30pm 10:15pm |
·
Function growth: O, theta, omega notation
(CLRS 3)
·
Recurrence relations (CLRS 4)
·
Probabilistic analysis; randomized algorithms
(CLRS 5)
·
Amortized analysis (CLRS 17)
·
Dynamic programming (CLRS 15)
·
Greedy algorithms (CLRS 16.1-3)
·
Sorting: heapsort,
quicksort, mergesort (CLRS 2, 6, 7)
·
Non-comparison-based (CLRS 8)
·
Selection/order statistics (CLRS 9)
·
Data structures balanced binary search trees
(CLRS 12, 13)
·
Graph algorithms: BFS/DFS (CLRS 22)
·
Minimum spanning tree (CLRS 23)
·
Shortest paths (CLRS 24, 25)
· Maximum
flow (CLRS 26.1-3)
· Time
complexity, NP-Complete (CLRS 34)
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.