國立高雄大學應用數學系 Class Code: AMC621 Instructor: Huilan Chang

<aside> 💡

本課程獲「113年度教育部人工智慧技術與應用領域系列課程－生成式人工智慧於科學教育的應用」補助。

</aside>

<aside> ⭐

公告

• TEST 1: 9/22, Unit 1
• TEST 2: 10/27 10:10-12:00, Unit 2 and Unit 3.
• TEST 3: 12/1 10:10~, Unit 5-6
• TEST 4: 22 10:10-11:00, Unit 8-9 Dynamic Programming

以下為四次小考成績，若有疑問，請1/5(一) 11:00前帶考卷找老師確認。

• Textbook: https://www.cs.mcgill.ca/~akroit/math/compsci/Cormen Introduction to Algorithms.pdf </aside>

Grading Policy∶

<aside> 💡

• TESTSx4 (80pts)

• Final Report (20pts) Prepare a term report and one-on-one 10min presentation to the instructor. 主題：

  🍄🍄🍄學期Project

  期未報告：第十六週~十八週。 學期報告繳交截止日期：12/26(五)

  <aside>

  上傳檔案：https://forms.gle/Lx3MmyGLuk52dE6C7

  </aside>

  上台報告順序： 12/29: 7b, 7a, 3b, 3c, 3d, 4, 6a, 6b

  1/5: 8a, 8b, 8c, 10b

• 排版規定：（可用其它軟體）

  final_report_template_en.docx

  https://gamma.app/docs/Google-NotebookLM-AI--m8vi3bzauqm7een

</aside>

Handouts:

**Programming: https://drive.google.com/drive/folders/18N65S3WPUFD6nAasfulbEaice95rd91w?usp=sharing**

Unit 1 Algorithms: Efficiency, Analysis, and Order

Unit 2 Order

Unit 3 Divide and Conquer Approach: Merge sort and Quick sort

Unit 4 Divide-and-conquer: Strassen’s matrix multiplication algorithm

Unit 5 Heap sort

Unit 6 Computational Complexity of Sorting Problem and Sorting in Linear Time

Unit 7 Sorting in Linear Time: Radix sort and Bucket sort

Unit 8 Dynamic Programming: Chained Matrix Multiplication

Unit 9 Dynamic Programming: Optimal Binary Search Trees

Unit 10 The Greedy Approach: The Activity-selection Problem

Unit 01 (114).pdf

Unit 02 (114).pdf

Unit 03 Divide and Conquer.pdf

Unit 04 Strassen's Method.pdf

Unit 05.pdf

Unit 5 Heap sort (new).pdf

Unit 6 Computational Complexity of Sorting Problem and Sorting in Linear Time.pdf

Unit 07 Sorting in Linear Time_ Radix sort and Bucket sort.pdf

Unit 08 Dynamic Programming_ Chained Matrix Multiplication.pdf

Unit 9 Dynamic Programming_ Optimal Binary Search Trees.pdf

Unit 10 The Greedy Approach_ The Activity-selection Problem.pdf