{"course":{"id":"112215710801","name":"程式設計與資料結構實務","enroll_type":"選修","general_type":"","dept":"四技電子系","grade":1,"class_group":"甲","teacher":"陳耀添","credit":3,"hour":3,"time":[{"day":1,"section":[7,8,8.5]}],"classroom":"","max":50,"min":10,"remark":"甲乙合班，資工系統模組選修","alt_for":"","courses":""},"detail":[["指定教材","作者：黃建庭\n書名：資料結構：使用Python\n出版商：全華\n發行地：台灣\n出版年份: 2021/3/8\nISBN：9789865035686"],["參考教材","線上課程: https://zh-tw.coursera.org/specializations/data-structures-algorithms"],["成績評量標準","平常成績(含作業、出席、與上課表現) 40%\n期中考 30%\n期末考 30%"],["教學方法","理論講授,實務講授"],["教學目標","教學目標是探討電腦內部的資料結構、建構方法、及運作方式，並研究演算法的設計與訓練學生對於資訊科學問題的解決與分析能力。「資料結構」是資料在電腦中儲存與組織的方式，一個設計良好的資料結構，應該盡可能在使用較少的時間與空間資源為前提之下，讓問題得以完整解決，「演算法」則是「資料結構」的延伸，主要的重心是進一步地探討「如何設計一套有結構、有效的方法來解決問題」，「程式設計」則利用相關程式語言所提供的基本函數，並根據上述「資料結構」與「演算法」將欲解決的問題實際製作出來。亦即設計良好的結構，用以儲存資料，透過高效能的演算法，使撰寫的程式更加精進，執行能力更具效率。"]],"office_time":[["陳耀添","星期二 6,7,8節"]],"schedule":[["2024/01/15","7","8.5","3","陳耀添","課程介紹、課程進行須知、與教學資源介紹","","1.課程介紹 2.評分方式 3.前測: 學習興趣量表、學習成效量表 4.異質分組",""],["2024/01/22","7","8.5","3","陳耀添","課程介紹、課程進行須知、與教學資源介紹","","教學套件簡介與教學資源介紹(包含: 網路大學系統、微軟Teams視訊會議軟體)",""],["2024/01/29","7","8.5","3","陳耀添","資料結構與演算法簡介","","1.資料儲存與組織方式 2.邏輯思維 3.數學於電腦科學的公式與遞迴表示法 4.虛擬程式碼與演算法",""],["2024/02/19","7","8.5","3","陳耀添","複雜度計算","回家作業1","1.科學符號表示 2.計算複雜性理論 3.時間複雜度 4.空間複雜度",""],["2024/02/26","7","8.5","3","陳耀添","陣列與堆疊","","1.記憶體內的配置 2.一維陣列與多維陣列 3.基本堆疊結構 4.使用迴圈(for, while, do while)語法來存取陣列與堆疊的元素",""],["2024/03/04","7","8.5","3","陳耀添","陣列與堆疊","回家作業2","1.先進後出(FILO)運作原理 2.堆疊指標 3.操作堆疊的函數: push 和pop演算法",""],["2024/03/11","7","8.5","3","陳耀添","佇列(Queue)","","1.基本佇列結構 2.如何宣告佇列與使用時機",""],["2024/03/18","7","8.5","3","陳耀添","佇列(Queue)","回家作業3","1.先進先出(FIFO)運作原理 2.head和tail指標 3.佇列為空與佇列為滿的判斷方法 4.加入(Enqueue)和移除(Dequeue)操作方法",""],["2024/03/25","7","8.5","3","陳耀添","期中考","","學生學習成效考核(程式設計上機考試)",""],["2024/04/01","7","8.5","3","陳耀添","鏈結串列(Linked List)","","1.鏈結串列的定義 2.鏈結串列的表示和實現 3.鏈結串列節點(node)的定義和宣告 4.鏈形鏈結串列",""],["2024/04/08","7","8.5","3","陳耀添","鏈結串列(Linked List)","回家作業5","1.在鏈結串列插入(insertions)與刪除(deletions) 2.head和tail指標 3.數學多項式用鏈結串列表示的方法 4.環形鏈結串列的操作",""],["2024/04/15","7","8.5","3","陳耀添","樹狀結構","","1.樹和二元樹 2.樹的定義和基本術語:「子節點」、「父節點」、「根」樹葉、Depth (深度)、Height (高度)等 3.二元樹的儲存結構",""],["2024/04/22","7","8.5","3","陳耀添","樹狀結構","","1.線性搜尋法 (linear search) 2.二元搜尋法 (迴圈程式) 3.二元搜尋法 (遞迴呼叫) 4.樹和森林的遍歷 5.赫夫曼樹及其應用",""],["2024/04/29","7","8.5","3","陳耀添","圖形結構","回家作業6","1.圖的儲存結構與表示法 2.深度優先搜尋 3.廣度優先搜尋 4.圖的連通性問題 5.最小生成樹 6.最短路徑",""],["2024/05/06","7","8.5","3","陳耀添","雜湊函數","","1.雜湊表的表示方法 2.雜湊函式的構造方法 3.處理衝突的方法 4.雜湊表的查詢及其分析",""],["2024/05/13","7","8.5","3","陳耀添","排序","","1.插入排序 2.快速排序 3.選擇排序 4.合併排序 5.基數排序",""],["2024/05/20","7","8.5","2.5","陳耀添","專題製作與競賽","","專題製作與競賽  分組專題製作與競賽",""],["2024/05/27","7","8.5","2.5","陳耀添","專題製作與競賽","專題程式作業","專題製作與競賽   後測：學習興趣量表、學習成效量表",""]]}