Algorithm Design and Analysis

(1)

Algorithm Design and Analysis Course Logistics

Yun-Nung (Vivian) Chen & Hsun-Chun Hsiao

http://ada.miulab.tw #ADA2021

(2)

Algorithm Design & Analysis

• Instructors

• 陳縕儂 Yun-Nung (Vivian) Chen (before midterm)

• 蕭旭君 Hsun-Chun Hsiao (after midterm)

• Time: Thursday 789, 14:20-17:20

• Location: livestreaming @ YouTube & COOL

• NTU COOL: https://cool.ntu.edu.tw/courses/8583

• Slides uploaded before each lecture

• sli.do real-time QA: #ADA2021

• Email: ada-ta@csie.ntu.edu.tw

• To ensure timely response, email title should contain “[ADA2021]”

• Do NOT send to our personal emails

• Knowledge required

• Programming (C/C++)

• Data structure

2

sli.do

(3)

NTU COOL

• Information on NTU COOL

• Homework/Mini-HW submission

• Discussion forum

3

(4)

4

#ADA2021

(5)

• Homework submission

• Specify the location for each problem

5

(6)

Gather

• Office hours at Gather.town

6

(7)

Textbook

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and

Clifford Stein. Introduction to Algorithms. 3rd edition, MIT Press, 2009

7 Slides credited from hil

(8)

Course Objective

• After taking this course, you should be able to

• Design correct and efficient algorithms

• Implement the designed algorithms

• Prove the correctness of algorithms

• Analyze the complexity of algorithms

8

(9)

Course Overview

Algorithmic Fundamentals

Introduction

Asymptotic Analysis

Algorithm Design Strategy

Divide-and- Conquer Dynamic Programming

Greedy Algorithms

Algorithm Analysis

Amortized Analysis

NP

Completeness

Graph &

Selected Topics

Graph Algorithms

Others

9

(10)

Course Syllabus

10

Week Topic Note

1 2021/09/23 Course Logistics & Introduction

2 2021/09/30 Divide-and-Conquer HW1 Release 3 2021/10/07 Divide-and-Conquer

4 2020/10/14 Dynamic Programming

5 2020/10/21 Dynamic Programming HW1 Due / HW2 Release 6 2020/10/28 Greedy Algorithms

7 2020/11/04 Greedy Algorithms

8 2020/11/11 Midterm Exam HW2 Due

9 2020/11/18 Graph Algorithms

10 2020/11/25 Graph Algorithms HW3 Release 11 2020/12/02 Graph Algorithms

12 2020/12/09 Amortized Analysis

13 2020/12/16 NP Completeness HW3 Due / HW4 Release 14 2020/12/23 NP Completeness

15 2020/12/30 Approximation Algorithms 16 2021/01/06 Final Exam

(11)

Powerful Teaching Team

陳威翰 _{(Lead TA)}

彭道耘塗大為蘇柏瑄鄭豫澤蔡旻諺簡謙益

林庭風魏任擇吳由由謝宗晅許耀文徐敬能

陳富中洪易熊育霆邢皓霆錢逸魁施佑昇

林楷恩 (Lead TA)

11

黃于軒

(12)

Grading Components

• Homework Assignments (40%)

• 4 in total; once per 2-3 weeks

• Programming and non-programming problems

• Mini-homework (15%)

• Once every week

• Best 10 scores (hand-written) + 2 scores (programming)

• Due before the next week class

• Midterm (20%)

• Course content before midterm

• Final Exam (20%)

• All course content

• Class Participation (5%)

• Default = 3%, additional bonus if you 1) ask questions @slido/COOL, 2) provide opinions during discussion, or 3) help your peers

12

(13)

Grading Rules

• Non-programming problems

• 可以與人討論及上網查資料，但必須理解後以自己的話來寫

• 註明該次作業為

1) 完全獨立完成

2) 列出參考資料 (網址、課本頁數) 3) 致謝共同討論同學

• 須以線上上傳 (COOL/gradescope)

• 盡量用電腦寫，若用手寫看不懂字體時一律不算分

• Programming problems

• 以測資分數計算，作業結束後會公布測資

• 上傳規定會在每次作業說明中，請務必仔細閱讀

• 作業抄襲，考試舞弊，抄襲者與被抄襲者學期成績零分

13

(14)

Question?

Important announcement will be sent to

@ntu.edu.tw mailbox & post to the course website

Course Website: http://ada.miulab.tw Email: ada-ta@csie.ntu.edu.tw

Algorithm Design and Analysis