CS3001302: Algorithms

9:10~10:00, Tuesday & 10:20~12:10, Wednesday @TR-310-1

Date	Syllabus	Homework
2/19	Course Overview
2/20	Algorithms & Analysis
2/26	Sick Leave, Sorry!
2/27	Analysis
3/5	Asymptotic Notations
3/6	Notations
3/12	Substitution Method
3/13	Recursion-tree and Master Methods	Homework 1 deadline: 3/27 10:20am
3/19	Divide-and-Conquer
3/20	Heap Sort
3/26	Heap Sort
3/27	Quick Sort
4/2	Break
4/3	Break
4/9	Discussion on HW1
4/10	Non-comparison Sorts
4/16	Rod-Cutting Problem
4/17	Matrix-chain Multiplication
4/23	Longest Common Subsequence
4/24	Midterm
5/1	Optimal Binary Search Trees	Homework 2 deadline: 5/21 8:00am
5/7	Disjoint-set Operations
5/8	Linked-list & Tree of Disjoint Sets
5/14	Break for ICASSP2019
5/15	Break for ICASSP2019
5/21	BFS & DFS
5/22	Strongly Connected Components
5/28	Minimal Spanning Trees	Homework 3 deadline: 6/9 23:59pm
5/29	Fundamental of Minimal Spanning Trees
6/4	Fundamental of Shortest Path Algorithms
6/5	Shortest Path Algorithms
6/11	Activity-selection Problem	Homework 4 deadline: 6/21 23:59pm
6/12	Greedy Algorithm
6/18	Study Holiday
6/19	Final Exam