CS2002302 & EC2002302: Data Structures

10:20~12:10, Monday & 11:20~12:10, Wednesday

 

Instructor: at

TAs:

 

Date Syllabus Homework
9/4 Course Overview
9/6 Program, Algorithm & Recursion
9/11 Performance Analysis HW0
9/13 Advanced Analysis
9/18 Arrays
9/20 Stacks
9/25 Prefix, Infix and Postfix
9/27 Queues HW1
10/2 Trees
10/4 Linked List & Binary Tree Traversal
10/9 Break
10/11 Binary Search Trees
10/16 AVL Trees
10/18 Red-Black Trees HW2
10/23 Splay Trees
10/25 B Trees
10/30 B+ and 2-3 Trees
11/1 Huffman Tree & Searching
11/6 Midterm Exam
11/8 Bubble, Insertion & Tree Sorts
11/13 Selection, Merge & Shell Sorts
11/15 Discussion on Midterm
11/20 Quick and Radix Sorts
11/22 Binary Heap, Heap Sort & Heap Variants HW3
11/27 Undirected & Directed Graphs
11/29 Advanced Graphs
12/4 Minimum Spanning Trees
12/6 Shortest Path Algorithms
12/11 Graph Traversal Algorithms
12/13 Hash Functions & Collision HW4
12/18 Final Exam