CS 223 Advanced Data Structures
and Algorithms
Spring 2008
Time & Location:
Lecture:
TR,11:00-12:15AM,EPS 103
Lab-02:
F,9:00-10:50 AM,EPS 254
Lab-03:
F,12:10-14:00PM,EPS 254
Instructor:
Neil Tang
tang@cs.montana.edu
EPS 360
(406) 994-4810
Office Hours:
MW,1:00PM-3:00PM
TA:
Aaron Hall
halla@cs.montana.edu
Office Hours & Location:
Tue 3:30-5:00PM,
Thu 12-1:30PM
EPS 346
Date
| Topic
| Reading
| Slides
| Homework |
|---|---|---|---|---|
01/17 |
Class Overview |
Syllabus |
||
01/22 |
Algorithm Analysis |
Ch2 |
||
01/24 |
Sorting and Master Method |
Ch7.2,Ch7.6,Ch7.7 (Textbook) & Ch4.3 (Cormen's book) |
||
01/29 |
Trees |
Ch4.1, Ch4.2 & Ch4.6 |
||
01/31 |
Binary Search Tree |
Ch4.3 |
||
02/05 |
AVL Tree
|
Ch4.4 |
||
02/07 |
Red-Black Tree
|
Ch12.2 |
||
02/12 |
Priority Queue and
Binary Heap |
Ch6.1-6.4 |
||
02/14 |
Heapsort and d-Heap
|
Ch6.5&Ch7.5 |
||
02/19 |
Hashing
|
Ch5.1-Ch5.2 |
||
02/21 |
Collision Resolution
|
Ch5.3-Ch5.5 |
HW1 Due |
|
02/26 |
Disjoint Set |
Ch8.1-Ch8.6 |
||
02/28 |
Graph
|
Ch9.1 |
||
03/04 |
Topological Sort
|
Ch9.2 |
|
|
03/06 |
Review for Midterm
|
HW2 Due |
||
03/11 |
No Class: Spring Break |
|||
03/13 | No Class: Spring Break |
|||
03/18
| Midterm |
11:00am-12:15pm
|
||
03/20 |
Review Midterm |
|||
03/25 |
Dijkstra's Algorithm
|
Ch9.3.2 |
||
03/27 |
The Bellman-Ford Algorithm
|
Ch24.1 (Cormen's book) |
||
04/01 |
Unweighted Shortes Path
|
Ch9.3.1 |
||
04/03 |
Minimum Spanning Tree
|
Ch9.5 |
||
04/08 |
Maximum Flow
|
Ch9.4 |
||
04/10 |
DFS
|
Ch9.6 |
||
04/15 |
Dynamic Programming 1
|
Ch10.3 |
||
04/17 |
HW3 Solution
|
|||
04/22 |
Dynamic Programming 2 |
Ch10.3 |
||
04/24 |
Divide and Conquer
|
Ch10.2 |
||
04/29 | Greedy Algorithms
|
Ch10.1 |
||
05/01 |
Review for Final |
|||
05/05 | Final Exam |
2:00-3:30pm |
||
05/07 |
Check your scores |
10:00am-12:00pm 1:00-3:00pm EPS 360 |
Note: Each homework assignment is due at the beginning of the corresponding class.
 |
 |
Copyright © Montana State University |