Course Syllabus

Course Information：

Year-Semester Course Number Course Name Phase Credits Hours Required/Elective Instructor Class Student NO. Withdraw Note

Spring Semester
Year 2025 341246 Data Structure 1 3.0 3 ★ Yibeltal Chanie Manie 4EOE2 51 0 計中電腦教室

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2025	341246	Data Structure	1	3.0	3	★	Yibeltal Chanie Manie	4EOE2	51	0	計中電腦教室

Course Plan：

Instructor Yibeltal Chanie Manie　Office Hours

Email yibeltal_chanie@mail.ntut.edu.tw

Last Updated 2024-12-20 15:23:31

Course Objective 本課程主要介紹在計算機科學中常見或基本的資料結構,探討的主題包括: ADT(抽像資料型態)及複雜度, 靜態結構與儲存表示, 陣列，堆疊，佇列，串列，樹狀結構，遞迴，排序, 搜尋。 This course is mainly aimed at introducing the data structures commonly used in programming languages which include ADT (abstract data type) and complexity, static structures and their storage representations, arrays, stacks, queues, linked lists, trees, recursion, sorting, and searching.

Course Schedule Week 1: Course Introduction and overview Week 2: Basic Concepts Week 3-4: Arrays Week 5-6: Stacks and Queues Week 7-8: Linked Lists Week 9-11: Trees Week 12-14: Graphs Week 15-16: Sorting Week 17-18: Final project and report

Evaluation and grading policy Homeworks: 40%, Labs reports: 20%, Attendance: 10%, Final project and report: 30%

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:Yes
Horowitz, Sahni, and Mehta. Fundamentals of Data Structures in C++ (2/E), 2nd edition

The access to curricular consultation email: yibeltal_chanie@mail.ntut.edu.tw

The course corresponds to the SDGs SDG4：優質教育（Quality Education）
SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure）

Note
　

Instructor	Yibeltal Chanie Manie　Office Hours
Email	yibeltal_chanie@mail.ntut.edu.tw
Last Updated	2024-12-20 15:23:31
Course Objective	本課程主要介紹在計算機科學中常見或基本的資料結構,探討的主題包括: ADT(抽像資料型態)及複雜度, 靜態結構與儲存表示, 陣列，堆疊，佇列，串列，樹狀結構，遞迴，排序, 搜尋。 This course is mainly aimed at introducing the data structures commonly used in programming languages which include ADT (abstract data type) and complexity, static structures and their storage representations, arrays, stacks, queues, linked lists, trees, recursion, sorting, and searching.
Course Schedule	Week 1: Course Introduction and overview Week 2: Basic Concepts Week 3-4: Arrays Week 5-6: Stacks and Queues Week 7-8: Linked Lists Week 9-11: Trees Week 12-14: Graphs Week 15-16: Sorting Week 17-18: Final project and report
Evaluation and grading policy	Homeworks: 40%, Labs reports: 20%, Attendance: 10%, Final project and report: 30%
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes Horowitz, Sahni, and Mehta. Fundamentals of Data Structures in C++ (2/E), 2nd edition
The access to curricular consultation	email: yibeltal_chanie@mail.ntut.edu.tw
The course corresponds to the SDGs	SDG4：優質教育（Quality Education） SDG9：產業創新與基礎設施（Industry, Innovation and Infrastructure）
Note