CS2002301 & EC2002302: Data Structures

10:20~12:10, Monday @TR-313 & 11:20~12:10, Wednesday @TR-212

 

Instructor: at

TA: dR & B_

 

Date Syllabus Homework
9/14 Course Overview
9/16 Program, Algorithm & Recursion
9/21 Performance Analysis Homework #0 (Deadline: 2020/10/05 10:20)
9/23 Advanced Analysis
9/28 Arrays
9/30 Stacks
10/5 Infix, Prefix and Postfix
10/7 Queues Homework #1 (Deadline: 2020/10/19 10:20)
10/12 Trees
10/14 Traversal for Binary Tree
10/19 Binary Search Trees
10/21 AVL Trees
10/26 Red-Black Trees
10/28 Splay Trees
11/02 B Trees
11/04 B+, 2-3, Huffman Trees
11/09 Searching Homework #2 (v2) (Deadline: 2020/11/25 23:55)
11/11 Study Holiday
11/16 Midterm Exam
11/18 Discussion on Midterm
11/23 Bubble, Insertion & Tree Sorts
11/25 Selection, Merge & Radix Sorts
11/30 Quick, Heap and Shell Sorts
12/02 Heap & Its Variants Homework #3 (Deadline: 2020/12/16 11:20)
12/07 Undirected & Directed Graphs
12/09 Advanced Graphs
12/14 Minimum Spanning Trees
12/16 Shortest Path Algorithms
12/21 Graph Traversal Algorithms Homework #4 (v2) (Deadline: 2021/01/11 10:20)
12/23 Hash Functions
12/28 Collision Homework #5 (v2) (Deadline: 2021/01/11 23:55)
12/30 Holiday for Studying
1/04 Final Exam
1/11 Discussion on Final Exam