[ADA 2021] Algorithm Design and Analysis
Frequently Asked Questions | Course Info | Syllabus | Grading Components
This is a portal page. Please check NTU COOL for the latest and detailed information.
Last updated on Sep 22, 2021.
Frequently Asked Questions
Q: Where can I access first week's class?
A: We will livestream on YouTube. To ensure everyone gets consistent information, the youtube link and any further announcements will be posted on the course website, which has been made public.
The instructions will be available soon. Stay tuned!
Q: How can I enroll?
A: This is a required course for sophomores in the CSIE department. Due to the high demand for this course, we will be experimenting with something new this year: We have listed this as a Type 1 Course and increased the limit to 350 students.
Q: Can I audit?
A: Yes, if you’re an NTU student. No, otherwise. Due to limited TA resources, we won’t grade your homework. If you would like to access COOL as an audit student, please fill in this form.
Q: What are the prerequisites?
A: We strongly recommend that you take data structure and programming first.
Course Info
- Course number: CSIE 2136
- Instructors: Yun-Nung (Vivian) Chen (first half) and Hsu-Chun Hsiao (second half)
- Location: Online (subject to change according to the latest COVID-19 prevention guideline)
R103 (livestreaming at R102 and R104) - Time: 14:20-17:20 (Thu.)
- Website: NTU COOL
- Email: ada-ta [at] csie.ntu.edu.tw
Syllabus
| Wk. | Date | Topic | Note |
|---|---|---|---|
| 1 | Sep 23 | Course Introduction | |
| 2 | Sep 30 | Divide-and-Conquer | HW1 out |
| 3 | Oct 07 | Divide-and-Conquer | |
| 4 | Oct 14 | Dynamic Programming | |
| 5 | Oct 21 | Dynamic Programming | HW1 due; HW2 out |
| 6 | Oct 28 | Greedy Algorithms | |
| 7 | Nov 04 | Greedy Algorithms | |
| 8 | Nov 11 | Mid-term Exam | HW2 due (11/10) |
| 9 | Nov 18 | Graph Algorithms | |
| 10 | Nov 25 | Graph Algorithms | HW3 out |
| 11 | Dec 02 | Graph Algorithms | |
| 12 | Dec 09 | Amortized Analysis | |
| 13 | Dec 16 | NP Completeness | HW3 due; HW4 out |
| 14 | Dec 23 | NP Completeness | |
| 15 | Dec 30 | Approximation Algorithms | |
| 16 | Jan 06 | Final exam | HW4 due (01/05) |
Grading Components
- Homework Assignments (40%)
- Mini-homework (15%)
- Midterm Exam (20%)
- Final Exam (20%)
- Class Participation (5%)