CS 2351 Data Structures (Spring 2012)

General Information
Lecturer: Wing-Kai Hon
wkhon @ cs
Tutors: Yiming Chen, Wisely Ku
Jenny Liu, Simon Chang
yiming @ cs, thku @ cs
hhliu @ cs, simonC @ cs
Meeting Time:
Mon 1010--1200, Wed 0900--0950
Lab: Tue 1900--2200
Tutorial (optional): Fri 1730--1900
Announcements
Exam 3

Written: June 18 (2 hours)

Programming: June 20 (2 hours)

Scope: BST, AVL Tree, B-tree

 

Scoring Method I

Written: Assignment (15%) Exam (30%)

Programming: Lab (15%) Exam (30%)

Project: 10%

--------------------------------------------------------

Final Score = Total * 100%

 

Scoring Method II

Written: Assignment (24%) Exam (48%)

Programming: Lab (6%) Exam (12%)

Project: 10%

--------------------------------------------------------

Final Score = Total * 90%

May 02: Notes 13 posted


  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
1 Getting Started Lecture 01 to Lecture 02
2 Sorting Lecture 04 to Lecture 06
3 Basic Data Structures Lecture 08 to Lecture 09
4 Graph and Tree Traversals Lecture 10 to Lecture 12
5 Searching Set Data Lecture 13 to Lecture 18
6 Advanced Topics Covered if we have time


Last updated: June 16, 2012