|
General Information
|
Lecturer: Wing-Kai Hon
|
|
wkhon @ cs
|
|
|
Tutors : Frank Chiu, Wisely Ku
Tutors : Foga Liu, Jenny Liu
|
|
csy @ cs ,
wiselyku @ gmail.com
fhliu @ cs, hhliu @ cs
|
|
Meeting Times:
|
|
Mon
1010—1200, Wed 0900—0950
|
|
New Assessment Weighting
4 Assignments (each 5%)
|
20%
|
3 Exams (each 20%)
|
60%
|
1 Final Project
|
20%
|
Total
|
100%
|
|
|
Announcement
Final Exam
Date
:
June 07 (2 hours)
Scope
: Notes 13 – 17,
20, HW 4
Final Project Released
See Description [pdf] and Topics [doc]
Registration Status
[link]
|
May 19:
|
Homework 4 [pdf] posted
|
May 25:
|
Notes 20 [pdf] posted
Tutorials 6 [pdf] and 7 [pdf] posted
|
May 31:
|
Notes 18 [pdf] and 21 [pdf] posted
|
|
Course Materials
Lecture
|
Topics
|
Related
Files
|
0
|
Overview
|
[pdf]
|
1
|
Getting Started
|
[pdf]
|
2
|
Growth of Functions
|
[pdf] [classwork]
|
3
|
Recurrences
|
[pdf]
|
4
|
Heaps
|
[pdf]
|
5
|
Sorting in Linear Time
|
[pdf]
|
6
|
Sorting Lower Bound
|
[pdf]
|
7
|
Pointers
|
[pdf]
|
8
|
Basic Data
Structures I (List, Queue, Stack)
|
[pdf] [errata]
|
9
|
Basic Data
Structures II (Tree, Graph)
|
[pdf]
|
10
|
Graph and Tree
Traversals I (BFS, DFS)
|
[pdf]
|
11
|
Graph and
Tree Traversals II (Tree Traversals, Expression Tree)
|
[pdf]
|
12
|
Graph and
Tree Traversals III (Topological Sort)
|
[pdf]
|
13
|
Searching
Set Data I (Binary Search Tree)
|
[pdf]
|
14
|
Searching
Set Data III (AVL Tree)
|
[pdf]
|
15
|
Searching
Set Data IV (B-Tree)
|
[pdf]
|
16
|
Probability
and Expectation
|
[pdf]
|
17
|
Hashing I
(Chaining, Open Addressing)
|
[pdf]
|
18
|
Hashing II
(Designing Hash Functions)
|
[pdf]
|
19
|
Hashing III
(Universal Hashing)
|
|
20
|
Suffix Tree
and Suffix Array
|
[pdf]
|
21
|
Amortized
Analysis
|
[pdf]
|
Teaching Plan
1
|
Getting Started
|
Lectures 01 to 03
|
2
|
Sorting
|
Lectures 04 to 06
|
3
|
Fundamental Data Structures
|
Lectures 07
to 09
|
4
|
Graph Traversals
|
Lectures 10 to 12
|
5
|
Searching Set Data
|
Lectures 13 to 19
|
6
|
Advanced Topics
|
Lectures 20 to 21
|
Last updated: May 25, 2010
|