e-Learning Course
Name 204251: Data Structures (International Program)
Semester 1 Year 2566
Prerequisites 204113 or 204211 or 204214 or 204215 or 204216 or 204217 or 204219
Announcements
Lecturer
Section 1 Meeting Time: Tuesday, Friday 11:00 – 12:30 Place: CSB100
===== Grading Policy ===== (Last Update on 28 August 2023)
Exam Dates
Lecture Schedule
Week | Topics | |
1 | Problem Solving and Concept of Abstraction | |
2 | Analysis of Algorithms | |
3-4 | Linear lists #1 , #2 | |
5 | Stacks #1 , #2 | |
6-7 | Queues #1, #2 | |
8 | Priority Queues | |
Midterm Exam |
8-9 | Set, Map and Hashing #1, #2, #3, | |
10-11 | Searching and Sorting #1, #2 | |
12-13 | Trees #1, #2, #3, #4 | |
14-15 | Graphs #1, #2, #3, #4 | |
Final Exam |
Notes on Code Submission
After student has finished coding and testing the program, student can upload the .py source code file directly to the assignment submission website:
http://hw.cs.science.cmu.ac.th (cmu account required).
Input and Output are case sensitive i.e. “yes” and “YES” are not the same.
Strictly take Input data with no extra wording i.e. “Please Input”.
Strictly display Output as instructed. Otherwise, the output is incorrect.
Recommended Readings
Data Structures and Algorithms in Python, Michael T. Goodrich,
et al.., Wiley, 2013
here
Data Structures and Algorithms With Python, Kent Lee and Steve Hubbard, Springer, 2015
here