TA Office Hours: Wednesday 5:30-6:30pm
in Room ECSS 4.209
E-mail: [email protected]
Introduction to Algorithms (3rd edition)
Part I Algorithms with Self-reduction
(1) Sorting and Divide-and-Conquer
Lecture 1 Introduction (Chapter 1~4)
Lecture 2 Sorting (Chapter 6~7)
Lecture 3 Sorting and Selection(Chapter 8~9)
Lecture 4 Divide-and-Conquer (Chapter 4)
Lecture 5 Problem Solving 1
(2) Shortest Path and Dynamic Programming
Lecture 6 Dynamic Programming (Chapter 15)
Lecture 7 Shortest Path (Chapter 24)
Lecture 8 All Pairs Shortest Path (Chapter 25)
Lecture 9 Problem Solving 2
(3) Minimum Spanning Tree and Greedy Algorithms
Lecture 10 Spanning Tree (Chapter 23)
Lecture 11 Greedy Strategy (Sec. 16.1~3)
Lecture 12 Matroid (Sec. 16.4~5)
Lecture 13 Problem Solving 3
Part II Incremental Methods
(4) Network Flow and Incremental Method
Lecture 18 Ford-Fulkerson Method (Sec 26.1-2)
Lecture 19 Maximum Matching (Sec. 26.3, Problem 26-6)
Lecture 20-21 Linear Programming (Chapter 29)
Lecture 22 Inremental Method
Lecture 23 Problem Solving 4
Part III Computational Complexity
(5) NP-hard Problems
Lecture 24 What's NP? (Chapter 34)
Lecture 25 NP-Complete Problems (Chapter 34)
Lecture 26 More NP-Complete Problems (Chapter 34)
Lecture 27 Problem Solving 5
NO LATE HOMEWORK will be accepted. (0 point will be given to late homework.)
PLEASE NOTE: You are encouraged to discuss with your classmates about homeworks.
Some "Pop Quize" may be given in class WITHOUT ANNOUNCEMENT. There is no make-up for any quiz.
There are two exams:
All examinations are in class (close book and notes).
The Midterm Exam on March 5.
The Final Exam on May 2.
The make-up Final Exam on May 9 at 9:00-10:15am.
(To take the make-up Final Exam, you need to submit a request through elearning.)
There are 5 points for each assignment, total 15 points
for Pop Quizes,
25 points for the Midterm Exam and 35 points for the Final Exam.
Grades will be assigned according to the total number of received points:
A >= 85 > B >= 70 > C >= 50.