{"course":{"id":"108112404601","name":"資料結構","enroll_type":"選修","general_type":"","dept":"四技電機系","grade":2,"class_group":"甲","teacher":"邱機平","credit":3,"hour":3,"time":[{"day":3,"section":[7,8,8.5]}],"classroom":"","max":30,"min":10,"remark":"甲乙合班授課","alt_for":"","courses":""},"detail":[["指定教材","樂以虎譯，資料結構 — 使用 C/C++ 語言，2005，高立圖書代理。"],["參考教材","1.Frank M. CarranoData Abstraction & Problem Solving with C++, Fifth Edition, 2007.\n2.連志誠編著，資料結構 — C 語言演義，2007.\n3.鍾宜玲編著，資料結構 — 使用 C 語言，八版，2010."],["成績評量標準","作業成績：30%\n平時成績：30%\n期末成績：40%"],["教學方法","理論講授"],["教學目標","演算法與資料結構相互結合可以應用至範圍相當廣泛的程式，除可增進設計技巧外亦可增進程式效率，因此，本課程之教學目標重點在於教授學生相關的概念並實際撰寫程式增進對資料結構的瞭解，以利學生日後進行相關的應用與學習。"]],"office_time":[["邱機平","週一至週五上午八點至下午五點。"]],"schedule":[["2019/09/18","7","8.5","3","邱機平","課程介紹","","第一週先針對本課程之授課內容、教授方式、實驗室管理規定以及課程評分標準等相關內容進行說明。",""],["2019/09/25","7","8.5","3","邱機平","第一章：資料結構簡介","","第一章介紹與資料結構相關的背景知識與使用到的工具，譬如虛擬碼寫法、抽象資料型態與分析演算法",""],["2019/10/02","7","8.5","3","邱機平","第二章 : 搜尋","","本章主要的目的在於介紹兩個搜尋演算法，包含串列搜尋以及二元搜尋，並且延伸至雜湊、碰撞等相關",""],["2019/10/09","7","8.5","3","邱機平","第二章 : 搜尋","","議題的處理，這是因為除了在第三章的鏈結串列會使用到此一概念外，在有序串列的循序搜尋中也會看",""],["2019/10/16","7","8.5","3","邱機平","第二章 : 搜尋","作業一","到相同的概念，二元搜尋樹（此一架構可以提供一個有效率的樹狀結構搜尋）即是一個例子。",""],["2019/10/23","7","8.5","3","邱機平","第三章 : 鏈結串列","","本章研究如何以鏈結串列方式來實作線性串列，並說明所有線性串列的一般概念，接著再發展練結串列",""],["2019/10/30","7","8.5","3","邱機平","第三章 : 鏈結串列","","的理論，最後再介紹鏈結串列的相關應用以增進學生對此議題的瞭解，同時，也會針對C++類別所設",""],["2019/11/06","7","8.5","3","邱機平","第三章 : 鏈結串列","作業二","計的串列抽象資料型態的基本實作部分進行介紹。",""],["2019/11/13","7","8.5","3","邱機平","期中考","","",""],["2019/11/20","7","8.5","3","邱機平","第四章：堆疊","","堆疊是一種線性串列，只能在其一端進行刪除與新增的動作，因此，在本章內即是針對堆疊的方式（後",""],["2019/11/27","7","8.5","3","邱機平","第四章：堆疊","","進先出）進行說明，當我們運用此一概念在資料結構時，堆疊的作用便會直接攸關資料存取的正確與否",""],["2019/12/04","7","8.5","3","邱機平","第四章：堆疊","作業三","，因此，相關概念應該要介紹。",""],["2019/12/11","7","8.5","3","邱機平","第五章：佇列","","佇列是一種線性串列，只能在一端進行資料的新增，此一端點稱為後端，而在另一端點進行刪除，則稱",""],["2019/12/18","7","8.5","3","邱機平","第五章：佇列","","為前端，因此資料的處理順序與接收順序是一致的，所以，佇列為一種先進先出的結構，所以，本章針",""],["2019/12/25","7","8.5","3","邱機平","第五章：佇列","作業四","對佇列部分有較多的說明，以其學生瞭解其基本概念。",""],["2020/01/01","7","8.5","3","邱機平","放假","","樹的結構對於資料存取有相當大的幫助，一個良好的樹的設計，可以增進整個程式的效率，因此，本單",""],["2020/01/08","7","8.5","3","邱機平","第六章：樹的概念介紹","","元部分會針對一些樹的基本概念進行介紹，增進學生對樹的瞭解。",""],["2020/01/15","7","8.5","3","邱機平","期末考","","",""]]}