Lectures

Part 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 Analysis of David-and-Conquer
Lecture 6 Problem Solving in Part 1

Part 2 Shortest Path and Dynamic Programming

Lecture 7 Shortest Path (Chapter 24)
Lecture 8 Speed Up and Data Structure (Chapter 24)
Lecture 9 All Pairs Shortest Path (Chapter 25)
Lecture 10 Dynamic Programming (Chapter 15)
Lecture 11 Analysis of DP (Chapter 15)
Lecture 12 Problem Solving in Part 2

Part 3 Minimum Spanning Tree and Greedy Algorithms

Lecture 13 Spanning Tree (Chapter 23)
Lecture 14 Matroid (Sec. 16.4~5)
Lecture 15 Greedy Strategy (Sec. 16.1~3)
Lecture 16 Property of MST
Lecture 17 Problem Solving in Part 3

Part 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 in Part 4

Part 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 in Part 5

Homeworks, Pop Quizes and Examinations

There are 5 homeworks for 5 parts

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. But, you cannot copy each other.

Some "Pop Quize" may be given in class WITHOUT ANNOUNCEMENT.

There are two exams:

The Midterm Exam on Feb. 28 (Parts 1-2).
The Final Exam on May 3 (Parts 3-5).
All examinations are in class (close book and notes).

Grade: 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.