一、課程基本資料 Course Information | ||||||||||||||||||||||||||||||||||||||||
科目名稱 Course Title: (中文)資料結構 (英文)DATA STRUCTURES |
開課學期 Semester:110學年度第2學期 開課班級 Class:數學三 |
|||||||||||||||||||||||||||||||||||||||
授課教師 Instructor:葉麗娜 YEH, LINA | ||||||||||||||||||||||||||||||||||||||||
科目代碼 Course Code:BMA21701 | 單全學期 Semester/Year:單 | 分組組別 Section: | ||||||||||||||||||||||||||||||||||||||
人數限制 Class Size:35 | 必選修別 Required/Elective:選 | 學分數 Credit(s):3 | ||||||||||||||||||||||||||||||||||||||
星期節次 Day/Session: 一78單 三12 | 前次異動時間 Time Last Edited:111年01月01日02時50分 | |||||||||||||||||||||||||||||||||||||||
數學系基本能力指標 Basic Ability Index | ||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||
二、指定教科書及參考資料 Textbooks and Reference (請修課同學遵守智慧財產權,不得非法影印) |
||||||||||||||||||||||||||||||||||||||||
●指定教科書 Required Texts Data Abstraction& Problem Solving with C++ Walls and Mirrors ,6th edition /Frank Carrano , Timothy Henry 新月書局有限公司 ●參考書資料暨網路資源 Reference Books and Online Resources 參考書: 1.基礎資料結構使用C++/ Horowitz, Sahni, Mahta 戴顯權譯 開發圖書公司 網路資源: 教師個人輔助教材 | ||||||||||||||||||||||||||||||||||||||||
三、教學目標 Objectives | ||||||||||||||||||||||||||||||||||||||||
讓學生認識電腦處理的資料其基本結構與相關的演算法,用以設計開發應用系統軟體程式,使得電腦執行時更為有效益。 課程安排電腦實作學習物件導向的程式設計。 |
||||||||||||||||||||||||||||||||||||||||
This course covers the fundamental data structures :Array, Linked list, Stack, Queue and Tree with related efficient algorithms, and introduce students to learn and implement the OOP. | ||||||||||||||||||||||||||||||||||||||||
四、課程內容 Course Description | ||||||||||||||||||||||||||||||||||||||||
●整體敘述 Overall Description 1. Basic Concepts Object-Oriented Design, Data Abstraction and Encapsulation, Basics of C++ 2. Array-Based Implementations 3. Link-Based Implementations Pointers, Polymorphism, and memory Allocation 4. Linked Lists Linear List, Linked List, Processing a Linked List, List applications 5. Stacks The Stack Abstract Data Type, Basic Stack operations, Stack applications 6. Queues The Queue Abstract Data Type, Basic Queue operations, Queue applications 7. Recurrsion How Recursion works, Designing Recursive Algorithms 8. Trees Basic Tree Concepts, Binary trees, Binary Tree Traversal and Expression Trees Binary Search Trees 9. Heaps Heap Definition, Heap Structure, Heap Data Structure, Heap Algorithms and Heap Applications 10. Searching List Searches, Hashing methods, Collision Resolution 平均每章在1-2週內完成 |
●分週敘述 Weekly Schedule
|
五、考評及成績核算方式 Grading | ||||||||||||||||||||
| ||||||||||||||||||||
六、授課教師課業輔導時間和聯絡方式 Office Hours And Contact Info | ||||||||||||||||||||
●課業輔導時間 Office Hour 星期二7,8節, 星期三3,4節 或同學預約其他時間 |
||||||||||||||||||||
●聯絡方式 Contact Info
|
七、教學助理聯絡方式 TA’s Contact Info | |||||
| |||||
八、建議先修課程 Suggested Prerequisite Course | |||||
九、課程其他要求 Other Requirements | |||||
十、學校教材上網、數位學習平台及教師個人網址 University’s Web Portal And Teacher's Website | |||||
學校教材上網網址 University’s Teaching Material Portal: 東吳大學Moodle數位平台:http://isee.scu.edu.tw |
|||||
學校數位學習平台 University’s Digital Learning Platform: ☑東吳大學Moodle數位平台:http://isee.scu.edu.tw ☑東吳大學Tronclass行動數位平台:https://tronclass.scu.edu.tw | |||||
教師個人網址 Teacher's Website:http://myweb.scu.edu.tw/~linayeh/homepg/yeh110/Yeh.htm | |||||
其他 Others: | |||||
十一、計畫表公布後異動說明 Changes Made After Posting Syllabus | |||||
1.成績考核各項配分比率若有更動會在課堂公布。 |