This course provides an introduction to the design and analysis of computer algorithms, with a particular emphasis on the use of principles of mathematical induction in designing algorithms. Its goal 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.

• 01/04: grade report available (revised 01/08); please send inquiries, if any, to the instructor by 2PM 01/06 (Fri.).
• 12/15: the draft of Suggested Solutions to Final 2021 Problems revised.
• 12/13: a draft of Suggested Solutions to Final 2021 Problems available (revised 12/15).
• 12/12: Suggested Solutions to Midterm Problems revised for Problem 10.
• 12/05: HW#10 due on 12/13.
• 12/05: notes/slides for NP-Completeness available.
• 12/05: notes/slides for Reduction available.
• 11/28: HW#9 due on 12/06.
• 11/28: notes/slides for Dynamic Programming available.
• 11/24: notes/slides for Basic Graph Algorithms revised.
• 11/21: HW#8 due on 11/29.
• 11/21: an illustration of Computing SCCs Using DFS is available.
• 11/07: HW#7 due on 11/16.
• 11/07: notes/slides for Advanced Graph Algorithms available.
• 11/07: Suggested Solutions to Midterm Problems available.
• 10/31: notes/slides for Basic Graph Algorithms available.
• 10/17: HW#6 due on 11/01.
• 10/17: notes/slides for String Processing available. (revised 10/18)
• 10/10: HW#5 due on 10/18; ACM ICPC 2016 World Finals Problem L.
• 09/30: old exams.
• 09/30: notes/slides for Searching and Sorting available.
• 09/30: notes/slides for A Supplement to Data Structures available.
• 09/27: HW#4 due on 10/04.
• 09/27: notes/slides for Design by Induction available.
• 09/20: HW#3 due on 09/27.
• 09/20: notes/slides for Analysis of Algorithms available.
• 09/12: HW#2 due on 09/20; deadline of HW#1 extended to 09/16.
• 09/06: HW#1 due on 09/13.
• 09/05: notes/slides for Introduction and for Mathematical Induction available.
• 07/29: this website created to complement the NTU COOL site for this course.

Yih-Kuen Tsay (蔡益坤), NTU IM Dept., 3366-1189, Xtsay@ntu.edu.twX (between the enclosing pair of X's).

Tuesday 2:20~5:20PM, Room 103, 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.

Tuesday 1:30~2:00PM, Wednesday 1:30~2:00PM, or by appointment, Room 1108, Management Building 2.

Emily Liu (劉品君), Xr11725032@ntu.edu.twX (between the enclosing pair of X's).
Yen-Liang Lai (賴彥良), Xr11725051@ntu.edu.twX (between the enclosing pair of X's).

• [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 3F-Course Reserves area 教師指定參考書區 under 演算法(BM-4). Additionally, eleven 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 3F-Course Reserves area 教師指定參考書區 under (FF-9).)

We will try to 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 six TA sessions on 09/20, 10/04, 10/18, 11/08, 11/29, and 12/13.)

• Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 09/06a) [notes, slides]
• Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 09/06b, 09/13) [notes, slides]
• Analysis of Algorithms [M: Ch. 3; C: Ch. 2,3,4] (1 week: 09/20*) [notes, slides]
• Design by Induction [M: Ch. 5] (1 week: 09/27) [notes, slides]
• Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,21] (.5 week: 10/04a*) [notes, slides, Building an AVL Tree (Illustration)]
• Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 10/04b, 10/11) [notes, slides, Heapsort (Illustration), Bottom-Up Heap Building (Illustration)]
• String Processing [M: Ch. 6; C: Ch. 32] (1 week: 10/18*) [notes, slides, Construction of a Huffman Tree (Illustration)]
• Midterm (2022/10/25)
• Graph Algorithms: Basic [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/01, 11/08a*) [notes, slides, Dijkstra's Algorithm (Illustration), Prim's Algorithm (Illustration)]
• Graph Algorithms: Advanced [M: Ch. 7; C: Ch. 22,23,24,25,26] (1.5 weeks: 11/08b, 11/22) [notes, slides, Computing SCCs (Illustration)]
• Dynamic Programming [C: Ch.15] (1 week: 11/29*) [notes, slides]
• Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 12/06a) [notes, slides]
• NP-Completeness [M: Ch. 11; C: Ch. 34] (1.5 weeks: 12/06b, 12/13*) [notes, slides]
• Final (2022/12/20)

• Mathematical Induction (a Wikipedia page)
• Structural Induction (a Wikipedia page)
• MIT OpenCourseWare: Introduction to Algorithms
• Stanford Coursera: Algorithms
• What is an Algorithm? (M.Y. Vardi, Communications of the ACM, Volume 55 Issue 3, March 2012)
• Sorting Algorithms Animations
• Graph Animations with Combinatorica
• The P versus NP Problem (Stephen Cook)
• The website of ICPC (International Collegiate Programming Contest)

Homework/Quizzes 20%, Participation 10%, Midterm 35%, Final 35%.