Steven Shao-Ting Chiu (d10945007@ntu.edu.tw Now, stchiu@email.tamu.edu)
Assignments | Projects | Topics | CI |
---|---|---|---|
Homework 0 | Greatest Common Divisor | pointer , gcd |
|
Nonogram Solver | recursive , nonogram |
||
Homework 1 | K-least Element | binary-search , linked-list , tree |
|
EvilEval: Parsing equations | parser , arithmetic-computation , expression-tree , stack |
||
WastonAbili: Doubly Linked List | doubly-linked-list , invert , reverse , delete |
||
Non-programming problems | time-complexity , master-theorem , array , linked-list |
||
Homework 2 | Fake Binary Search Tree | binary-search-tree , tree-traversal-algorithm , recursion |
|
Intersecting Triangles | divide-and-conquer , merge-sort , computation-geometry |
||
Package Arrangement | priority-queue , doubly-linked-list , leftist-heap |
||
Non-programming problems | sorting , decision-tree-model , binary-tree , heap |
||
Garbled Text Editor | string-matching , robin-karp-algorithm |
||
Homework 3 | Priority Tree | priority-tree , rolling-linked-list , invert , reverse |
|
Graph Reconstruction | graph , queue , edge-list |
||
Non-programming problems | hash , linear-probing , double-hashing , string-matching , disjoint-sets , amortized-analysis |
||
Final Project | Email Searcher | disjoint-set , robin-karp-algorithm , expression-match |
This is the lecture note for the DSA course at NTU, it is used for non-profit education purpose. For the teaching resources, I tried my best to cite each source to avoid copyright issues. If one found inappropriate contents, please inform me via email (d10945007@ntu.edu.tw).
- Course ID: CSIE 1212
- Room: CSIE R103 (main) + CSIE R102, R104
- Time: Tuesday, 13:20 ~ 16:10
- Lecturer: Hsuan-Tien Lin & Hsin-Mu (Michael) Tsai
- Contact:
dsa_ta@csie.ntu.edu.tw
# | Date | Topic | Lecturer | |
---|---|---|---|---|
1 | 02/23 (Tue.) | Course Introduction | Hsuan-Tien | |
2 | 03/02 (Tue.) | Arrays and Linked Lists | Hsuan-Tien | |
3 | 03/09 (Tue.) | Performance Evaluation | Hsuan-Tien | |
4 | 03/16 (Tue.) | Stacks and Queues | Hsuan-Tien | Homework 1 announced |
5 | 03/23 (Tue.) | Heap | Hsuan-Tien | |
6 | 03/30 (Tue.) | Tree (Traverse + BST) | Hsuan-Tien | |
7 | 04/06 (Tue.) | Spring Break | ||
8 | 04/13 (Tue.) | Sorting | Hsuan-Tien | Homework 1 due; Homework 2 announced |
9 | 04/20 (Tue.) | Midterm | Hsuan-Tien | |
10 | 04/27 (Tue.) | String Matching | Hsinmu | |
11 | 05/04 (Tue.) | Linear-Time Sorting | Hsinmu | |
12 | 05/11 (Tue.) | Disjoint Set | Hsinmu | |
13 | 05/18 (Tue.) | Hashing | Hsinmu | Homework 2 due; Homework 3 announced |
14 | 05/25 (Tue.) | RB Tree | Hsinmu | |
15 | 06/01 (Tue.) | Graph | Hsinmu | |
16 | 06/08 (Tue.) | B Tree | Hsinmu | |
17 | 06/15 (Tue.) | Final Exam | Hsinmu | Homework 3 due |
18 | 06/22 (Tue.) | Project Week |
(Duplicate from course website)