Course Materials
|
|
Lecture
|
Topics
|
Related Files
|
|
0
|
Overview
|
[pdf]
|
|
1
|
Getting Started
|
[pdf]
|
|
2
|
Growth of Functions
|
[pdf]
[classwork]
|
|
3
|
Recurrence (Skipped)
|
[pdf]
|
|
4
|
Heap
|
[pdf]
|
|
5
|
Sorting in Linear Time (Skipped)
|
[pdf]
|
|
6
|
Lower Bound for Comparison Sorts
|
[pdf]
|
|
7
|
Pointers in C
|
[pdf]
|
|
8
|
Basic Data Structures (List, Stack, Queue)
|
[pdf]
|
|
9
|
Basic Data Structures (Trees, Graphs)
|
[pdf]
|
|
10
|
Graph and Tree Traversals (BFS, DFS)
|
[pdf]
|
|
11
|
Graph and Tree Traversals (Preorder, Inorder, Postorder)
|
[pdf]
|
|
12
|
Graph and Tree Traversals (Topological Sort)
|
[pdf]
|
|
13
|
Searching Set Data (Binary Search Tree)
|
[pdf]
|
|
14
|
Searching Set Data (AVL Tree)
|
[pdf]
|
|
15
|
Searching Set Data (B-Tree)
|
[pdf]
|
|
16
|
Searching Set Data (Hashing I)
|
[pdf]
|
|
17
|
Searching Set Data (Hashing II)
|
[pdf]
|
|
18
|
Suffix Tree and Suffix Array
|
[pdf]
|
|
19
|
KMP Algorithm
|
[pdf]
|
|
20
|
Dynamic Programming
|
[pdf]
|
|
21
|
Greedy Algorithm
|
[pdf]
|
Teaching Plan