# Schedule

 Week 1: 8/22 Overview slides: 20230822 Course intro.pdf snippets: a.c b.c, n.c, o.c, office_hours.c, p.c, q.c 8/24 Complexity analysis, Big-O Week 2: 8/29 …, Big-Omega, Big-Theta 8/31 …, wrap-up LE01 snippets: _notes.0130.txt Week 3: 9/5 Stack implementation HW01: Complexity, due 9/6 (Wed) 9/7 Stack - preview HW02 snippets: a.stack a.stack.c, b.bst.c, n.stack, n.stack.c, o.c Week 4: 9/12 Iterative traversals using stack 9/14 Experssion evaluation snippets: _notes.0130.txt _notes.0300.txt, a.c, j.c, n.c Week 5: 9/19 Expression evaluation, sorting HW02: Stack, due 9/19 (Tue) 9/21 Sorting Week 6: 9/26 Quick sort, selection 9/28 " snippets: _notes.0130.txt Week 7: 10/3 Recurrence relations, Master theorem notes: 20231003 notes.pdf HW03: Selection, due 10/3 (Tue) 10/5 Exam 1 practice Week 8: 10/12 NO LECTURE Week 9: 10/17 Exam 1 10/19 Trees, AVL rotations (primer) slides: 20231019 avl tree.pptx Week 10: 10/24 AVL trees, code notes: 20231024 AVL trees.pdf snippets: avl.0130.c bst.c, n.c 10/26 Heaps snippets: avl.c avl.h Week 11: 10/31 Heaps, heap sort, code, Exam 2 info Exam 2 topics: (cumulative), trees, AVL trees, heaps, heapsort, (TBA). To study, code up examples from class cold (from blank file, no notes). Also, be able to do HW04 offline (no web, AI) for something unfamiliar. HW04: Master theorem, due 10/31 (Tue) 11/2 Heaps — uses, delete, insert Week 12: 11/7 B-trees - introduction notes: B-trees.pdf 11/9 B-trees - insert Notes are under Tue 11/7. Week 13: 11/14 HW05 walk-through 11/16 Hashing + hash table Week 14: 11/21 NO LECTURE HW05: B-Tree 1, due 11/21 (Tue) Week 15: 11/28 Graphs notes: graphs.pdf HW06: B-Tree 2, due 12/2 (Sat) 11/30 Dijkstra's algorithm for shortest path and/or b-tree delete HW06 1:30 PM section: See Boilercast (via Brightspace » Course Tools » Kaltura) for the HW06 help from the 3:00 PM section3:00 PM section: We spent some time talking about HW06, but had less time for Dijkstra. Anything on Exam 3 will be limited to what was covered in your section.There was a lecture exercise (le09) in the notes. Since 3:00 PM didn't have enough time to finish it, this one will be factored out for anyone who did not do it (regardless of section). Week 16: 12/5 " HW07: Graphs, due 12/9 (Sat) EC01: Hashing, due 12/9 (Sat) 12/7 "

To try code snippets, right-click to copy URL. Then, in bash, type `wget URL` (where URL is the URL you copied from this page.) To paste in PuTTY, try Shift-Right_Mouse_Click or Shift-Insert_Key. (Do not do that in Vim.)

Assignments and deadline may be changed without notice up to 1 week before the due date.