CS 380 Schedule
|
Date
|
Topic
|
Notes
|
Assignments
|
| Aug 26 |
Introduction / Motivation Insertion Sort |
01-PDF |
Ch 1, 2 Assignment Zero |
| Aug 28 |
Divide and Conquer Merge Sort |
02-PDF |
|
| Aug 30 |
More Sorting | Decision Trees | Comparison Sort Implementation Discussion |
Sorting | |
| Sep 2 |
Labor Day - No Class |
||
| Sep 4 |
|||
| Sep 6 |
Complexity of Divide and Conquer / Recurrence | 03 | Ch 3 |
| Sep 9 |
Complexity of Divide and Conquer / Recurrence | |
Sorting DUE Ch 6 |
| Sep 11 | Heap Sort Priority Queues |
04 | |
| Sep 13 | Heap Sort Priority Queues |
Disk
Scheduling Ch 7 |
|
| Sep 16 | STL / Implementation | 05 Example Reference Example Code |
|
| Sep 18e | Review | ||
| Sep 20 |
MIDTERM | ||
| Sep 23 |
Quick Sort |
06 |
Ch 7 Disk Scheduling (Pt 1) Due |
| Sep 25 |
Quick Sort | Quicksort
Paper quicksort Partition |
Ch 8 |
| Sep 27 |
|
Disk Scheduling (Pt 2) Due HOMEWORK - check Moodle |
|
| Sep 30 |
Linear Sorting / Order Statistics (Linear) | 07 |
Sorting Large Files |
| Oct 2 |
Linear Sorting / Order Statistics (Linear) |
07_2 | Homework
- check
Moodle |
| Oct 4 |
Fall Break - No Class |
||
| Oct 7 |
Review Homework 1 Order Statistics (Linear) |
08 | |
| Oct 9 |
Order Statistics (Linear) Red-Black Trees |
||
| Oct 11 |
Sorting Large Files Data Analysis |
Sorting Large Files Due IN CLASS |
|
| Oct 14 | order statistics (dynamic) Interval trees |
||
| Oct 16 | Review |
||
| Oct 18 |
MIDTERM |
||
| Oct 21 |
RedBlackTree Delete Augmented Trees |
08 09 |
|
| Oct 23 | Lab Day |
LAB | |
| Oct 25 | Lab Day |
Survey |
|
| Oct 28 |
Graph Algorithms Breadth-first Search Depth-first Search |
14 |
|
| Oct 30 |
Minimum Spanning Trees (Kruskal, Prim) |
16 |
|
| Nov 1 |
Implementation | Path Finding | |
| Nov 4 |
Single-Source Shortest Path | 17 |
|
| Nov 6 |
Dynamic Programming chapter 15 |
11 |
|
| Nov 8 | Longest Common Subsequence chapter 15 | 20 | Path Finding Design |
| Nov 11 |
String Similarity / Levenshtein Edit Distance |
||
| Nov 13 | MIDTERM |
||
| Nov 15 |
Sequence Alignment / String Matching (Naive, Horspool) |
||
| Nov 18 |
LAB WORK |
Phylogenetic
Tree Tardos Book Neighbor Joining Tree Building, high level BioInf Algorithms |
Lab
Map |
| Nov 20 |
LAB WORK |
Assignment | Path Finding Due |
| Nov 22 |
LAB WORK | |
Path Finding Demo Due |
| Nov 25 |
LAB WORK | ||
| Nov 27 |
NO CLASS |
||
| Nov 29 |
NO CLASS |
||
| Dec 2 |
Review |
||
| Dec
6 |
FRIDAY, 3-5:30 pm FINAL EXAM | Review |