基本素養 Basic Literacy

graduates should equip with both the attitude of technological/cultural literacy and the consciousness of information engineering ethics

graduates should equip with appropriate communication skill and global view

核心能力 Competence

graduates should equip with the basic capability of the fundamental of professional mathematics and theoretical knowledge in informatics

graduates should equip with the capability of information theory derivation、experiment design and experimental data analysis/induction

graduates should equip with the capability of learning interest development and continuous learning

graduates should equip with the capability to think creatively and independently and to explore, analyze, and solve information-related problems

graduates should equip with the information system ability in designing and verification

graduates should equip with the capability of system integration

graduates should equip with a responsible attitude in working and the capability of effective team-work collaboration

課程概述 Course Description

Introduce the algorithms' analysis and design. Training students how to design and analysis of algorithms. The course contents include: 1.Foundations (Chapters 1-2) 2.Growth of Functions (Chapters 3) 3.Recurrences (Chapters 4) 4.Heapsort (Chapters 6) 5.Quicksort (Chapters 7) 6.Sorting in Linear Time (Chapters 8) 7. Medians and Order Statistics (Chapters 9) 8.Dynamic Programming (Chapters 15) 9.Greedy Algorithms (Chapters 16) 10.Elementary Graph Algorithms (Chapters 22) 11.Minimum Spanning Trees (Chapters 23) 12. Single-Source Shortest Paths (Chapters 24)

課程學習目標 Course Objectives

• 會證明演算法的正確性及利用數學技巧分析演算法的時間複雜度。
• 認識各種重要的演算法。
• 訓練學生充分瞭解演算法的基礎知識。
• 會設計演算法去解決資訊工程各領域的問題。
• 課程進度 Progress Description

進度說明 Progress Description
1The Role of Algorithms in Computing
2Growth of Functions
3Recurrences
4Analysis of Algorithms
5Heapsort
6Quicksort
7Sorting in Linear Time
8Medians and Order Statistics
9期中考
10Dynamic Programming(1)
11Dynamic Programming(2)
12Greedy Algorithms
13Elementary Graph Algorithms(1)
14Elementary Graph Algorithms(2)
15Minimum Spanning Trees
16Single-Source Shortest Paths
17All-Pairs Shortest Paths
18期末考
以上每週進度教師可依上課情況做適度調整。The schedule may be subject to change.

有關課程其他調查 Other Surveys of Courses

1.本課程是否規劃業界教師參與教學或演講?
Is there any industry specialist invited in this course? How many times?
2.本課程是否規劃含校外實習(並非參訪)?
Are there any internships involved in the course? How many hours?
3.本課程是否可歸認為學術倫理課程?
Is this course recognized as an academic ethics course? In the course how many hours are regarding academic ethics topics?
4.本課程是否屬進入社區實踐課程?
Is this course recognized as a Community engagement and Service learning course? Which community will be engaged?