Course Syllabus

Course Information：

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

Spring Semester
Year 2023 316690 Data Structure 1 3.0 3 ▲ CHUAN-MING LIU 4EECS2 42 1 資工組必修，EMI英文

Year-Semester	Course Number	Course Name	Phase	Credits	Hours	Required/Elective	Instructor	Class	Student NO.	Withdraw	Note
Spring Semester Year 2023	316690	Data Structure	1	3.0	3	▲	CHUAN-MING LIU	4EECS2	42	1	資工組必修，EMI英文

Course Plan：

Instructor CHUAN-MING LIU　Office Hours

Email cmliu@ntut.edu.tw

Last Updated 2022-12-20 08:05:32

Course Objective Data structures play an important role in computer science and can make the program or systems work efficiently in terms of time and space. This course introduces the fundamental structures and some advanced ones, including arrays, stacks, queues, linked lists, maps and dictionaries, hash tables, trees and graphs, as well as priority queues. In addition, the analysis tools and design issues for data structures will be discussed. For any inquiry, please use the following contact information: Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)

Course Schedule 1. Introduction and Recursion (3hrs) 2. Analysis Tools (5hrs) 3. Arrays, Stacks, and Queues (2hr) 4. Linked Lists (3hrs) 5. Trees (6hrs) 6. Priority Queues (6hrs) 7. Maps and Dictionaries (6hrs) MIDTERM EXAM (3hrs, review session included) 8. Search Trees (10hrs) 9. Graphs (7hrs) FINAL EXAM (3hrs, review session included)

Evaluation and grading policy 1.Assignments (40%): 6-8 homework sets 2.Midterm (25%) 3.Final exam (35%) For any inquiry, please use the following contact information: Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)

Materials All right reserved. Do not reproduce without permission.

Foreign-language textbooks:Yes
-Textbook: Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, Data Structures and Algorithms in Python, Wiley, 2013, ISBN-13: 978-1118290279 -References: 1. Robert Kruse, Clovis Tondo, and Bruce Leung, Data Structures & Program Design in C, 2nd edition, Prentice-Hall, 2008. ISBN:978-986-154-730-5 2. Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Frees, Fundamentals of Data Structures in C, 2ndedition, Silicon Press, 2008. ISBN:0-929306-40-6. 3. Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in JAVA, 4th edition, John Wiley & Sons, 2006. ISBN: 0-471-73884-0. 4. Sartaj Sahni, Data Structures, Algorithms, and Applications in JAVA, 2nd edition, Silicon Press, 2005. ISBN: 0-929306-33-3. 5. Frank M. Carranno and Walter Savitch, Data Structures and Abstractions with Java, Prentice Hall, 2003. ISBN: 0-13-017489-0.

The access to curricular consultation Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams)
Line ID: mobile.prof
FB: facebook.com/howard.liu.5
Phone: 4251 (in school)

Expanding teaching and resources

The course corresponds to the SDGs

Does the course incorporate AI

Note
In case of the need for distance learning, the on-line teaching will be given during the official class hours using Microsoft Teams.

Instructor	CHUAN-MING LIU　Office Hours
Email	cmliu@ntut.edu.tw
Last Updated	2022-12-20 08:05:32
Course Objective	Data structures play an important role in computer science and can make the program or systems work efficiently in terms of time and space. This course introduces the fundamental structures and some advanced ones, including arrays, stacks, queues, linked lists, maps and dictionaries, hash tables, trees and graphs, as well as priority queues. In addition, the analysis tools and design issues for data structures will be discussed. For any inquiry, please use the following contact information: Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)
Course Schedule	1. Introduction and Recursion (3hrs) 2. Analysis Tools (5hrs) 3. Arrays, Stacks, and Queues (2hr) 4. Linked Lists (3hrs) 5. Trees (6hrs) 6. Priority Queues (6hrs) 7. Maps and Dictionaries (6hrs) MIDTERM EXAM (3hrs, review session included) 8. Search Trees (10hrs) 9. Graphs (7hrs) FINAL EXAM (3hrs, review session included)
Evaluation and grading policy	1.Assignments (40%): 6-8 homework sets 2.Midterm (25%) 3.Final exam (35%) For any inquiry, please use the following contact information: Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)
Materials	All right reserved. Do not reproduce without permission. Foreign-language textbooks:Yes -Textbook: Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, Data Structures and Algorithms in Python, Wiley, 2013, ISBN-13: 978-1118290279 -References: 1. Robert Kruse, Clovis Tondo, and Bruce Leung, Data Structures & Program Design in C, 2nd edition, Prentice-Hall, 2008. ISBN:978-986-154-730-5 2. Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Frees, Fundamentals of Data Structures in C, 2ndedition, Silicon Press, 2008. ISBN:0-929306-40-6. 3. Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in JAVA, 4th edition, John Wiley & Sons, 2006. ISBN: 0-471-73884-0. 4. Sartaj Sahni, Data Structures, Algorithms, and Applications in JAVA, 2nd edition, Silicon Press, 2005. ISBN: 0-929306-33-3. 5. Frank M. Carranno and Walter Savitch, Data Structures and Abstractions with Java, Prentice Hall, 2003. ISBN: 0-13-017489-0.
The access to curricular consultation	Emails: cmliu@ntut.edu.tw( school); 11107@cc.ntut.edu.tw (Microsoft Teams) Line ID: mobile.prof FB: facebook.com/howard.liu.5 Phone: 4251 (in school)
Expanding teaching and resources
The course corresponds to the SDGs
Does the course incorporate AI
Note	In case of the need for distance learning, the on-line teaching will be given during the official class hours using Microsoft Teams.