| Algorithm 2011 |
- Instructor:
- Ming-Te Chi (紀明德), Assistant Professor
- e-mail: mtchi AT cs.nccu.edu.tw.
- Class time: Friday 234 (am 9:10~12:00)
- Classroom: 大仁樓200301
- TA:
- News
|
| Week |
Topic |
Chapter |
Slides |
Resource |
| 01 02/25 |
Introduction |
1 |
Syllabus
slide-intro |
|
| 02
03/04 |
Getting
Started |
2 |
Ch2 |
MIT course
video |
| 03 03/11 |
Growth of
Functions
Divide and Conquer |
3
4.1~4.2 |
Ch3
Ch4 |
|
| 04
03/18 |
Divide
and Conquer
Sorting I - Heapsort |
4.3~4.5
6 |
Ch6 |
|
| 05 03/25 |
Sorting I -
Heapsort
quiz1 |
6
|
|
|
| 06
04/01 |
Sorting
II
Quicksort
Sorting in linear time
|
7
8
|
Ch7
Ch8
|
|
| 07 04/08 |
Elementary
Data Structure
quiz2
|
10
|
Ch10
|
|
| 08
04/15 |
Binary
Search Tree
|
12
|
Ch12 |
|
| 09 04/22 |
Midterm Exam
10:10~12:00 |
Ch.
1~4, 6~8, 10, 12 |
|
|
| 10
04/29 |
Dynamic
Programming
|
15
|
Ch 15
|
http://miktex.org/
cwtex |
| 11 05/06 |
Greedy Algorithm
|
16
|
Ch 16 |
|
| 12
05/13 |
Greedy Algorithm
NP-Completeness
hw2 deadline |
34 |
|
未來數學家的挑戰:
計算量問題
NP_completeness |
| 13 05/20 |
運動會
(停課) |
|
|
|
| 14
05/27 |
Elementary
Graph Algorithms
Minimum Spanning Tree
Oral presentation by student
繳交期末書面大綱 |
22
23
|
|
|
| 15 06/03 |
Shortest Path
Problem
Oral presentation by student
quiz 3 |
24
|
|
|
| 16
06/10 |
Maximun
Flow
Oral presentation by student
繳交期末書面報告和投影片 |
26 |
|
|
| 17 06/17 |
Finalterm Exam
10:10~12:00 |
CH. 15, 16, 22, 23, 24, 26, 34 |
|
|
|
|
Homework |
Deadline |
content |
Resource |
| 1 |
Hw1 |
3/25 10:00 am |
Exercise pdf
2.2-1, 2.2-2, 2.3-4, 3.1-4
|
|
| 2 |
Quiz1 |
3/25 11:40 am |
Ch.3 ~ Ch.4 |
|
| 3 |
Quiz2 |
04/08
11:40 am |
Ch.6
~ Ch.8.2 |
|
| 4 |
Hw2 |
5/13 10:00 am |
Exercise pdf
15.1-5, 15.3-5 |
|
| 5 |
Quiz 3 |
06/03
11:40 am |
Ch. 15, Ch 16, Ch 34 |
solution |
| 6 |
|
|
|
|
|
- Grading:
- Homework and Quiz: 30%
- Midterm Exam: 25%
- Finalterm Exam: 25%
- Finalterm Project: 20%
- Texturebook:
- Thomas H. Cormen, Introduction to Algorithms 3rd
edition, MIT Press(開發書局代理), 2009
- Reference book:
- Anany Levitin, Introduction to The Design and
Analysis of Algorithm 2ed, Pearson, 2007.
|