壹.教學投影片
Chapter1 | |
Chapter2 | |
Chapter3 | |
Chapter3append | |
Chapter4 | |
Chapter5 | |
Chapter6 | |
Chapter7 | |
Chapter8 | |
Chapter9 |
貳.作業
Homeworks |
參.大綱
一、教學目標:
1
認識演算法
1 學習一般的資料結構
1 設計及分析演算法及
1 評量演算法
1
實作能力訓練
二、課程計畫:
Week |
Subject |
Assignment |
1 |
Introduction to C++ and Algorithms |
|
2 |
C++ and Arrays |
|
3 |
Arrays |
Homework 1 due |
4 |
Stack and Queues |
|
5 |
Linked Lists |
|
6 |
Linked Lists |
Homework 2 due |
7 |
Trees |
|
8 |
Trees |
|
9 |
Middle examination |
|
10 |
Graphs |
|
11 |
Graphs |
|
12 |
Internal Sorting |
|
13 |
Internal Sorting |
|
14 |
Hashing |
Homework |
15 |
Heap Structures |
|
16 |
Search Structures |
|
17 |
Final examination |
|
三、教學方法:
理論研討與實例分析演練
四、評量標準:
Mid. Exam.(20%), Final Exam.(40%), and Homework(40%)
五、授課時數:
3 hours per week
六、教材與參考書目:
Text Book:Ellis Horowitz, Sartaj Sahni, and Dinesh Mehta, “Fundamentals of Data Structures in C++,” Computer Science Press |