CS2002301 & CS2002302 & EC2002301 & EC2002302 & AT3407301: Data Structures

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

 

Instructor: at

TAs:

 

Date Syllabus Homework
9/5 Course Overview
9/7 Program, Algorithm & Recursion
9/12 Performance Analysis HW0
9/14 Advanced Analysis
9/19 Arrays
9/21 Stacks
9/26 Prefix, Infix and Postfix
9/28 Queues HW1
10/3 Trees
10/5 Linked List & Binary Tree Traversal
10/10 Break
10/12 Binary Search Trees
10/17 AVL Trees
10/19 Red-Black Trees HW2
10/24 Splay Trees
10/26 B Trees
10/31 B+ and 2-3 Trees
11/2 Huffman Tree & Searching
11/7 Midterm Exam
11/9 Bubble, Insertion & Tree Sorts
11/14 Selection, Merge & Shell Sorts
11/16 Discussion on Midterm
11/21 Quick and Radix Sorts
11/23 Binary Heap, Heap Sort & Heap Variants HW3
11/28 Undirected & Directed Graphs
11/30 Advanced Graphs
12/5 Minimum Spanning Trees
12/7 Shortest Path Algorithms
12/12 Graph Traversal Algorithms
12/14 Hash Functions & Collision HW4
12/19 Final Exam