[CSED233] Data Structure
POSTECH
POSTECH
Spring 2026
Instructor: Seung-Hwan Baek
Teaching Assistants: Yujin Jeon, Yunseong Moon, Hoon-Gyu Chung, Yonghee Oh
Spring 2026
Instructor: Seung-Hwan Baek
Teaching Assistants: Yujin Jeon, Yunseong Moon, Hoon-Gyu Chung, Yonghee Oh
Data Structures is an essential area of study for computer scientists and for anyone who will ever undertake any serious programming task. This course deals with the fundamentals of organizing and manipulating data efficiently using clean conceptual models. Students study many of the important conceptual data types, their implementation, and analysis of their efficiency. Topics will cover algorithm analysis, lists, trees, priority queues, dictionaries (hash tables, balanced search trees), graphs, strings (tries, pattern matching), and sorting.
Tuesdays and Thursdays, 9:30 AM – 10:45 AM, Engineering Building #2, Room 102.
Course slides will be available on PLMS.
PLMS will serve as our main communication platform.
Questions are welcome before, during, and after lectures.
Office hours are available by appointment via email with the instructor.
TA Office hours are available on PLMS.
Four assignments: 60 pts
Midterm and final terms: 60 pts each
Course participation: 10 pts
Introduction to Data Structure
C++ Review
Algorithm and Time Complexity
List, Stack, Queue
Tree (1)
Tree (2)
Priority Queue, Heap
Sorting
Binary Search Tree
AVL Tree
B Tree
Dictionary and Hashing
Graph Representation
Graph Traversals
Shortest Path Finding
Minimum Spanning Tree
String
Regular Expression