COURSE INFORMATION (First Handout)
TENTATIVE SCHEDULE
| Week |
|
|
| WEEK1, Jan 14, 16 | Introductory class | Algo, ADT (Ch1), Recursion (2.4) |
| WEEK2, Jan 21, 23 | Rec-n: TOH, Fib, Prj1-A | Alg.Anal.(Ch3) |
| WEEK3, Jan 28, 30 | Linear vs. Binary Search | 4.1: List ADT, Arrays vs. Linked Lists |
| WEEK4, Feb 4, 6 | Linked Lists (Cont-d) | Prj Q's, Prj1-D, Prj2-A |
| WEEK5, Feb 11, 13 | Stacks | Stacks/Queues |
| WEEK6, Feb 18, 20 | Class Canceled (Snow) | Queues, Binary Trees |
| WEEK7, Feb 25, 27 | Prj2-D, BST | Balancing BSTs, Tree Traversal, Q's |
| WEEK8, Mar 4, 6 | MIDTERM | Class Canceled (Snow) |
| WEEK9, Mar 11, 13 | SPRING BREAK | SPRING BREAK |
| WEEK10, Mar 18, 20 | Elementary Sorting | MergeSort, Prj3-A |
| WEEK11, Mar 25, 27 | MergeSort, QuickSort | QuickSort |
| WEEK12, Apr 1, 3 | Prj3-D, Prj4-A, BinSort, Hashing | Hashing, Prj Disc-n |
| WEEK13, Apr 8, 10 | File Processing, Buffers | Internal vs. External Sorting, Merging |
| WEEK14, Apr 15, 17 | Multi-Way Merging | Multiple-Step Merging, File Proc. Overview |
| WEEK15, Apr 22, 24 | Prj4-D, Heaps, Semester Overview | Semester Overview, Final Q's |
| FINAL Tuesday, May 6, 8:15-10:15pm, RI-104 | ||
A = Assigned
D = Due
S = Lecture Slide