Course Information

   Yun-Nung (Vivian) Chen; Hsun-Chun Hsiao
   Video at COOL/YouTube
   Thursday 14:20 - 17:20
   Introduction to Algorithm, 3rd Edition Cormen, Leiserson, Rivest and Stein

Syllabus

14.114.214.314.414.5
Date Description Course Recordings Note
2022/09/08 Course Logistics
Introduction
 0.1 0.2
1.1 1.2 1.3
2022/09/15 Divide-and-Conquer 1
2.1 2.2 2.3
2.4 2.5 2.6
2022/09/22 Divide-and-Conquer 2
Divide-and-Conquer 3 		3.1 3.2 3.3
4.1 4.2 4.3
2022/09/29 Dynamic Programming 1 5.1 5.2 5.3 5.4
2022/10/06 Dynamic Programming 2 6.1 6.2 6.3 6.4 6.5 6.6
2022/10/13 Greedy Algorithms 1 7.1 7.2 7.3 7.4
2022/10/20 Greedy Algorithms 2
Midterm Review 		8.0 8.1 8.2 8.3 8.4
9.1 9.2
2022/10/27 Midterm Exam
2022/11/03 Graph Algorithms 8.1 8.2 8.3
2022/11/10 Graph Algorithms 9.1 9.2 9.3 9.4
9.5 9.6 9.7 		HW 3
2022/11/17 Graph Algorithms 10.1 10.2 10.3 10.4
2022/11/24 Amortized Analysis 11.1 11.2 11.3
2022/12/01 NP Completeness 12.1 12.2 12.3 HW 4
2022/12/08 NP Completeness 13.1 13.2 13.3 13.4
2022/12/15 Approximation Algorithms
2022/12/22 Final Exam

Homework

The programming part should be submitted via Online Judge.
NO LATE SUBMISSION IS ALLOWED!

  • The only language supported on the judge is C++ and we are using g++ 7.1.1 as the compiler.
  • The compiler options used to compile your code is g++ -std=c++14 -O2 -static.

Teaching Team

Please send your questions to ada-ta@csie.ntu.edu.tw.
Please make sure the title of your mail starts with [ADA2022].

Role Name Office Hour Location
Instructor Hsu-Chun Hsiao Mon 16:00 - 17:00 R511
Instructor Yun-Nung (Vivian) Chen By request R418
Lead TA 蔡旻諺
Lead TA 簡謙益