SCHEDULE FOR CPT S 223 (FALL 2012)

All dates and topic schedule are tentative. So keep checking this site regularly.

*Links to homeworks and programming projects will be activated on their posting dates.

 Class Day Date Topic Readings (Chapter.Section from Weiss book) Assignments* Due Posting 1 M 8/20 Introduction 1.1, 1.2 2 W Math review 1.2, 1.3 3 F " 4 M 8/27 Elementary data structures (stacks, queues, arrays) 3 HW1 5 W " 6 F Algorithmic analysis 2.1, 2.2, 2.3 --- M 9/3 Labor day - Holiday Program 1 7 W* C++ review and programming projects overview (TAs) 1.4-1.6 8 F Algorithmic analysis HW1 9 M 9/9 Maximum subsequence sum problem 2.4 10 W " HW2 11 F " 12 M 9/17 Trees 4.1, 4.2 13 W Trees Program 1 14 F Trees: BST, Balanced BST (AVL tree) 4.3, 4.4 Program 2 15 M* 9/24 " HW2 HW3 16 W* HW1, HW2 review 17 F AVL Trees 18 M* 10/1 B-trees 4.7 19 W B-trees 20 F Search trees in STL: sets and maps 4.8 Program 2 21 M 10/8 Midterm review HW3 22 W Midterm I 23 F Priority queues: Binary heaps, binomial heaps 6.1-6.3, 6.8-6.9 Program 3 24 M 10/15 Priority queues: Binary heap, binomial heap 6.1, 6.2, 6.3, 6.8, 6.9 25 W " 26 F " 27 M 10/22 Hashing 5.1 - 5.6 HW4 28 W " Program 3 Program 4 29 F " 30 M 10/29 Disjoint sets: Union-find 8.1 - 8.5 31 W Disjoint sets HW4 HW5 32 F Sorting: Insertion sort, Heap sort 7.1-7.3, 7.5 33 M 11/5 Sorting: Merge sort, Quick sort, Lower bound 7.6, 7.7, 7.9 34 W Sorting: Lower bound, External sorting 7.9, 7.11 Program 5 35 F Midterm II review (HW3-5) HW5 36 M 11/12 Veteran's day - Holiday 37 W* Midterm II 38 F Graphs introduction 9.1-9.3, 9.5 Program 4 --- M 11/19 THANKSGIVING WEEK --- W --- F 38 M 11/26 Graphs: some interesting problems HW6 39 W " Program 5 40 F String data structures: tries, PATRICIA tree, suffix trees, suffix arrays notes 41 M 12/3 " 42 W HW6 review, Course Review HW6 43 F Discussion/Q&A --- M 12/10 FINAL EXAM  Monday, December 10, 8:00AM -10:00AM --- W --- F