DATA STRUCTURES CMSC 341-09 Mark E Woodcock Fall 2025 ITE 216 455-3554 SON 208 (MW 1430-1545) woodcock@cs.umbc.edu OH: TW 1330-1430 AUG 25 Intro/ADTs (2) SEP 1 C++ & Memory 8 Lists (3.2-3) Arrays QQQ 15 Double Lists (3) Efficiency (4.1) 22 Stacks/Qs (5.1-3) Trees (10) 29 BST Removes AVL Trees (10.2) QQQ OCT 6 Splay Tree (10.5) Heaps, PQ (8) 13 Leftist/Skew QQQ Review 20 Midterm Slack 27 Induction HeapSort/Amortization NOV 3 Return Maps (9) QQQ 10 Hashing (9) Linear Probing (9) 17 SkipList Graphs (13) 24 Red-Blk Tree (10) QQQ 2-4 Trees (10.3) DEC 1 Tries K-D Trees 8 Review FINAL (Friday) 15 CLASS SESSION The anticipated topics for each lecture is identified above, although they are subject to change. Recommended readings from the text are noted above (where applicable). TESTS A Midterm Examination will be given during standard class time on 20 October. The Final Examination will be given on December 12th (1300-1500). Both tests will be comprehensive and closed book (& closed notes); and in the usual classroom. Quizzes will be short, on-line and in class time. ASSIGNMENTS See blackboard for the details. Homeworks and projects will be relatively weighted based on their importance and difficulty. GRADER/TA This semester, this task will be shared by a pool of folks across all sections. See blackboard for their availability. Ian Cox (icox1@umbc.edu): 12-14 F and 1445-1645 R. Haley Patel (hpatel21@umbc.edu): R 1200-1400 GRADES Quizzes 5 Midterm 20 Projects 35 Homework 10 Final 30 I expect to see a Bell Curve Distribution of grades using a 90=A, 80=B etc grading system; but where necessary/appropriate I will give all A's, flunk everybody, curve the grades or consider relative improvement (or something else).