COURSE INFORMATION (First Handout)
TENTATIVE SCHEDULE
| Week |
|
|
| WEEK1, Jan 21 | - | Introductory class |
| WEEK2, Jan 26, 28 | Algo, ADT (Ch1), Recursion (2.4) | Rec-n: TOH, Fib, Prj1-A |
| WEEK3, Feb 2, 4 | Alg.Anal.(Ch3) | <canceled - panel> |
| WEEK4, Feb 9, 11 | Linear vs. Binary Search | 4.1: List ADT, Arrays vs. Linked Lists |
| WEEK5, Feb 16, 18 | Linked Lists, Prj Q's, Prj1-D, Prj2-A | Stacks - Implementations |
| WEEK6, Feb 23, 25 | Stacks - Applications | Queues |
| WEEK7, Mar 1, 3 | Queues, Binary Trees, BSTs | Balancing BSTs |
| WEEK8, Mar 8, 10 | Prj2-D, Tree Traversal, Q's | MIDTERM |
| WEEK9, Mar 15, 17 | SPRING BREAK | SPRING BREAK |
| WEEK10, Mar 22, 24 | Midterm Q's, Sorting Problem |
Elementary Sorting, Prj3-A |
| WEEK11, Mar 29, 31 | MergeSort | MergeSort, QuickSort |
| WEEK12, Apr 5, 7 | QuickSort | Prj3-D, Prj4-A, BinSort, Hashing |
| WEEK13, Apr 12, 14 | Hashing, Prj Disc-n | File Proc. Basics, Internal
vs. External
Sorting |
| WEEK14, Apr 19, 21 | External MergeSort |
Multi-Way/Multiple-Step Merging |
| WEEK15, Apr 26, 28 | Heap, Heapsort |
Prj4-D, Parallel Comp. - My Research Overview |
| WEEK 16, May 3 |
Semester Overview | - |
| FINAL Monday, May 10, 5:30-7:30pm, RI-267 | ||
A = Assigned
D = Due