| 週次 |
授課內容 |
| 第1週 |
Introduction to Data Structures and Algorithms
Course overview, role of algorithms, project briefing |
| 第2週 |
Object-Oriented Programming
Classes, objects, inheritance, modular design |
| 第3週 |
Modules & Algorithm Analysis
Program structure, Big-O notation, efficiency trade-offs |
| 第4週 |
Recursion & Iteration
Recursive vs. loop-based problem solving |
| 第5週 |
Stacks, Queues & Data Management
Core operations, examples in scheduling and buffering |
| 第6週 |
Linked Lists
Lists, operations, comparison with arrays |
| 第7週 |
Trees
Binary trees, traversals, basic balancing |
| 第8週 |
Searching & Sorting
Search methods, sorting algorithms |
| 第9週 |
Graphical User Interface (GUI)
Basics of event-driven programming, simple UI building |
| 第10週 |
Exam
Covers Weeks 1–9: fundamentals, data structures, algorithms |
| 第11週 |
Project Development I
Begin implementation; supervised coding sessions |
| 第12週 |
Project Development II
Continue development; checkpoints |
| 第13週 |
Project Development III
Refinement and testing; peer evaluation |
| 第14週 |
Project Development IV
Short updates, feedback, debugging support |
| 第15週 |
Final Presentation I
Formal presentations and oral defence |
| 第16週 |
Final Presentation II
Remaining presentations, peer review, reflection
|
自主學習 內容 |
   03.製作專題報告
|