{"course":{"id":"114162701P01","name":"資料結構","enroll_type":"必修","general_type":"","dept":"人工智慧學程","grade":2,"class_group":"甲","teacher":"高黃江","credit":3,"hour":3,"time":[{"day":3,"section":[2,3,4]}],"classroom":"","max":56,"min":10,"remark":"English-taught course","alt_for":"","courses":""},"detail":[["指定教材",""],["參考教材","1. Fundamentals of Data Structures in C++, Horowitsm Sahni, Mehta"],["成績評量標準","Homework: 50%\nMidterm: 25%\nFinal: 25%"],["教學方法","理論講授,實務講授"],["教學目標","- Basic C++ Programming\n-  Learn and implement basic data structures in C++: lists, stacks, queues, trees, and graphs.\n- Understanding the algorithm of basic operators of those data structures.\n- Apply data structure to solve the practical problems"]],"office_time":[["高黃江","Office: AI Center, Innovation Building | 3F\nOffice hours: Thursday Morning, 9:00 - 12:00"]],"schedule":[["2025/09/10","2","4","3","高黃江","C++: Input, output, data type, variable","","C++: Input, output, data type, variable",""],["2025/09/17","2","4","3","高黃江","C++: Condition Statement, Loop statement","","C++: Condition Statement, Loop statement",""],["2025/09/24","2","4","3","高黃江","C++: Functions, Variable Scope","","C++: Functions, Variable Scope",""],["2025/10/01","2","4","3","高黃江","C++: Basic Algorithms","","Min, Max, Count, Sum, Search conditioned number",""],["2025/10/08","2","4","3","高黃江","C++: Object Oriented Programming","","C++: Object Oriented Programming",""],["2025/10/15","2","4","3","高黃江","User-defined data structure 1/2","","User defined data structure in Python (2D Point, Time, Fraction, Big Number)",""],["2025/10/22","2","4","3","高黃江","User-defined data structure 2/2","","User defined data structure in Python (2D Point, Time, Fraction, Big Number)",""],["2025/10/29","2","4","3","高黃江","Data structure: List","","Introduction to List, common operators (insert, delete, traversal, search, count, etc)",""],["2025/11/05","2","4","3","高黃江","Data structure: List: practice","","Practice on List",""],["2025/11/12","2","4","3","高黃江","Midterm","","",""],["2025/11/19","2","4","3","高黃江","Stacks 1/2","","Introduction to stacks (LIFO)",""],["2025/11/26","2","4","3","高黃江","Stacks 2/2","","Stack implementation using lists",""],["2025/12/03","2","4","3","高黃江","Queues 1/2","","Introduction to queues (FIFO)",""],["2025/12/10","2","4","3","高黃江","Queues 2/2","","Queue implementation using lists",""],["2025/12/17","2","4","3","高黃江","Tree / Binary Tree 1/2","","Tree Representation",""],["2025/12/24","2","4","3","高黃江","Tree / Binary Tree 2/2","","Tree traversal methods (in-order, pre-order, post-order)",""],["2025/12/31","2","4","3","高黃江","Stack - Queue - Tree: Practice","","Practice on Stack-Queue-Tree",""],["2026/01/07","2","4","3","高黃江","Final Exam","","",""]]}