{"course":{"id":"112162700I01","name":"資料結構與演算法","enroll_type":"必修","general_type":"","dept":"人工智慧學程","grade":2,"class_group":"甲","teacher":"李建興","credit":3,"hour":3,"time":[{"day":4,"section":[3,4]},{"day":4,"section":[5]}],"classroom":"","max":56,"min":10,"remark":"Partially taught in English","alt_for":"","courses":""},"detail":[["指定教材","Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed\n“Fundamentals of Data Structures in C”, 2nd Ed., 2007"],["參考教材","基礎資料結構 ─ 使用 C (Fundamentals of Data Structures in C, 2/e), 蔡錫鈞、戴顯權 譯, 2008, 開發圖書"],["成績評量標準","作業: 50% \n期中考: 25% \n期末考: 25%"],["教學方法","理論講授,實務講授,個人實驗(實作)"],["教學目標","資料結構是一個程式設計的核心課程. 主要介紹的是最基本常用的資料結構及程式設計知識及技巧.此課程也是銜接程式設計和演算法的課程.此三門課為同學奠定了最重要的程式設計的能力."]],"office_time":[["李建興","Wed. 11:00 - 12:00\nWed. 13;00 -15:00\nThu. 09:00 - 10;00\nThu. 14:00 - 16:00"]],"schedule":[["2023/09/14","3","4","2","李建興","簡介","","概論",""],["2023/09/14","5","5","1","李建興","簡介","","指標和動態記憶體配置",""],["2023/09/21","3","4","2","李建興","簡介","","演算法描述",""],["2023/09/21","5","5","1","李建興","簡介","","資料抽象化, 演算法效能分析",""],["2023/09/28","3","4","2","李建興","陣列與結構 Array and Structure","","陣列, 動態配置陣列",""],["2023/09/28","5","5","1","李建興","陣列與結構 Array and Structure","","結構",""],["2023/10/05","3","4","2","李建興","陣列與結構 Array and Structure","","多項式",""],["2023/10/05","5","5","1","李建興","陣列與結構 Array and Structure","","稀疏矩陣",""],["2023/10/12","3","4","2","李建興","陣列與結構 Array and Structure","","多維陣列",""],["2023/10/12","5","5","1","李建興","陣列與結構 Array and Structure","作業1","字串",""],["2023/10/19","3","4","2","李建興","堆疊和佇列 Stack and Queue","","堆疊",""],["2023/10/19","5","5","1","李建興","堆疊和佇列 Stack and Queue","","使用動態陣列之堆疊",""],["2023/10/26","3","4","2","李建興","堆疊和佇列 Stack and Queue","","佇列, 使用動態陣列之環狀佇列",""],["2023/10/26","5","5","1","李建興","堆疊和佇列 Stack and Queue","作業2","迷宮問題",""],["2023/11/02","3","4","2","李建興","堆疊和佇列 Stack and Queue","","運算式的計算",""],["2023/11/02","5","5","1","李建興","堆疊和佇列 Stack and Queue","","多重堆疊和佇列",""],["2023/11/09","3","4","2","李建興","期中考","","期中考",""],["2023/11/09","5","5","1","李建興","期中考","","期中考",""],["2023/11/16","3","4","2","李建興","鏈結串列 Linked List","","單向鏈結串列與鏈(chain)",""],["2023/11/16","5","5","1","李建興","鏈結串列 Linked List","","在C中表示鏈",""],["2023/11/23","3","4","2","李建興","鏈結串列 Linked List","","鏈結堆疊和佇列",""],["2023/11/23","5","5","1","李建興","鏈結串列 Linked List","作業3","多項式",""],["2023/11/30","3","4","2","李建興","鏈結串列 Linked List","","更多的串列操作",""],["2023/11/30","5","5","1","李建興","鏈結串列 Linked List","","等價類",""],["2023/12/07","3","4","2","李建興","鏈結串列 Linked List","","稀疏矩陣",""],["2023/12/07","5","5","1","李建興","鏈結串列 Linked List","作業4","雙向鏈結串列",""],["2023/12/14","3","4","2","李建興","樹狀結構 Tree","","緒論, 二元樹(binary tree)",""],["2023/12/14","5","5","1","李建興","樹狀結構 Tree","","二元樹的走訪",""],["2023/12/21","3","4","2","李建興","樹狀結構 Tree","","更多的二元樹運算",""],["2023/12/21","5","5","1","李建興","樹狀結構 Tree","","引線二元樹(threaded binary tree), 堆積(heap)",""],["2023/12/28","3","4","2","李建興","樹狀結構 Tree","作業5","二元搜尋樹",""],["2023/12/28","5","5","1","李建興","樹狀結構 Tree","","選擇樹(selection tree), 樹林(forest)",""],["2024/01/04","3","4","2","李建興","樹狀結構 Tree","","互斥集合表示法",""],["2024/01/04","5","5","1","李建興","樹狀結構 Tree","","計算二元樹的個數",""],["2024/01/11","3","4","2","李建興","期末考","","期末考",""],["2024/01/11","5","5","1","李建興","期末考","","期末考",""]]}