本課程旨在介紹資料結構（Data Structures）與演算法的基本概念、設計原理及實務應用，使學生了解如何有效組織、儲存與管理資料，並培養程式設計與問題解決能力。課程內容涵蓋演算法分析與時間複雜度、陣列、鏈結串列、堆疊、佇列、樹狀結構、二元搜尋樹、堆積、圖形、雜湊表，以及排序與搜尋等重要主題。透過理論講解、案例分析與程式實作，學生將學習各種資料結構的特性、操作方法及適用情境，並能根據不同問題選擇適當的資料結構與演算法，以提升程式執行效率與系統效能，進而奠定後續演算法、人工智慧、資料庫及軟體開發等相關領域的學習基礎。

This course aims to introduce the basic concepts, design principles and practical applications of data structures (Data Structures) and algorithms, so that students can understand how to effectively organize, store and manage data, and develop programming and problem-solving abilities. The course content covers important topics such as algorithm analysis and time complexity, arrays, linked lists, stacks, queues, tree structures, binary search trees, stacks, graphics, hash tables, and sorting and searching. Through theoretical explanations, case analysis and program implementation, students will learn the characteristics, operating methods and applicable scenarios of various data structures, and be able to choose appropriate data structures and algorithms according to different problems to improve program execution efficiency and system performance, thereby laying the foundation for subsequent learning in related fields such as algorithms, artificial intelligence, databases and software development.

本課程在於學習各種不同的資料表現形式，使散亂的資料能夠以規則方式呈現並進行有效率的運算處理。在本課程內容安排上，將介紹常用的資料結構與相關演算法，包含堆疊(stack)、佇列(queue)、樹(tree)、圖(graph)、排序(sorting)等，可廣泛地運用在不同領域上。

This course aims to learn various data representation forms so that scattered data can be presented in a regular manner and processed efficiently. In terms of the content arrangement of this course, commonly used data structures and related algorithms will be introduced, including stack, queue, tree, graph, sorting, etc., which can be widely used in different fields.

自編教材

Self-edited teaching materials