This is an old revision of the document!
Algorithms, Spring 2014
The goal of this course is to acquaint the students with basic computer
algorithms and their design principles and to cultivate the students' ability
in designing and analyzing algorithms independently.
Announcements
06/28:
grade report available; please send inquiries, if any, to the instructor by 2PM 06/29.
06/03: notes/slides for NP-Completeness and an appendix available.
05/28:
HW#10 due on 06/10.
05/27: notes/slides for Dynamic Programming and Reduction available.
05/20:
HW#9 due on 06/03.
05/20: notes/slides for Advanced Graph Algorithms available.
05/13:
HW#8 due on 05/20.
-
04/29: notes/slides for Basic Graph Algorithms available.
04/22:
HW#7 due on 04/29.
04/22: notes/slides for String Processing available.
-
-
04/08:
HW#6 due on 04/15.
04/08:
HW#5 (Programming Exercise #1) due on 04/22.
04/01: notes/slides for A Supplement to Data Structures and for Searching and Sorting available.
03/18:
HW#4 due on 04/01.
03/11:
HW#3 due on 03/21.
03/10: due date of HW#2 postponed till 3/14.
03/10: notes/slides for Design by Induction available.
03/04: notes/slides for Analysis of Algorithms and an appendix on Solving a Recurrence Relation with Generating Functions available.
03/03:
HW#2 due on 03/11.
02/25:
HW#1 due on 03/04.
02/18: notes/slides for Introduction and Mathematical Induction and an appendix on Proving a Loop Invariant available.
02/17: this website created.
Instructor
Yih-Kuen Tsay (蔡益坤), NTU IM Dept.,
3366-1189, Xtsay@ntu.edu.twX
(between the enclosing pair of X's).
Lectures
Tuesday 2:20~5:20PM, Room 205, Management Building 2.
TA
sessions will be scheduled prior to some of the class meetings between 1:20
and 2:10PM; see the course schedule below.
Office Hours
Tuesday 1:30~2:00PM, Wednesday 1:30~2:00PM, or by appointment, Room 1108,
Management Building 2.
TAs
施舜元, 3366-1209, Xr02725014@ntu.edu.twX
(between the enclosing pair of X's).
李孟, 3366-1209, Xr02725032@ntu.edu.twX
(between the enclosing pair of X's).
Textbooks
[M]
Introduction to Algorithms - A Creative Approach, U. Manber, Addison-Wesley, 1989. (Four copies of this book have been put on reserve at NTU Library in the B1-教師指定參考書區 under 演算法(BM-4). Additionally, ten copies are available for loan; please contact one of the TAs.)
[C]
Introduction to Algorithms, Third Edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, MIT Press, 2009. (開發圖書代理; one copy of this book has been put on reserve at NTU Library in the B1-教師指定參考書區 under (FF-9).)
Syllabus/Schedule (with links to notes/slides)
This course provides an introduction to the design and analysis of computer
algorithms. A particular emphasis is given to principles of mathematical
induction and their use in designing algorithms. The course will cover most
of Manber's book plus supplementary material, including a few chapters of the
book by Cormen et al. (Note: a TA session will precede a class meeting
whose date is marked with an *. There are four TA sessions on 3/18, 4/8,
5/20, and 6/3, making up the missed class meeting on 3/25.)
Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 2/18a) [
notes,
slides]
-
-
Design by Induction [M: Ch. 5] (1 week: 3/11) [
notes,
slides]
Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 3/18a*) [
notes,
slides]
Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (2.5 weeks: 3/18b, 4/1, 4/8*) [
notes,
slides]
Midterm (2014/04/15)
String Processing [M: Ch. 6; C: Ch. 32] (1 week: 4/22) [
notes,
slides]
Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (3 weeks: 4/29, 5/6, 5/13) [
notes,
slides]
Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1 week: 5/20*) [
notes,
slides]
Dynamic Programming [C: Ch.15] (.5 week: 5/27a) [
notes,
slides]
Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 5/27b) [
notes,
slides]
-
Final (2014/06/17)
References
-
-
-
-
-
-
The website of
ACM-ICPC (International Collegiate Programming Contest)
Grading
Homework 20%, Participation 10%, Midterm 35%, Final 35%.