Homework | StudentTracker | Syllabus |

We'll be meeting twice a week in person (with no required online component)

Class meetings: Mondays and Wednesday, 1:15pm – 3:20pm, Room CC1-231

Note that while there are no current plans to change the schedule, we may end up doing so anyways.

Lecture # |
Date |
Topic |
Presenters |
Reading |
Due Dates:Self-Written ("from scratch") |
Due Dates:Use an existing library |

1 | Class Orientation AVL Trees: Insert |
Pg.296, online materials (see below) Notes/Talking Points |
||||

2 | AVL Trees – Insert | Updated A1 (please include due dates) | ||||

3 | AVL Trees – Insert | A1 Due
A1 revision due date will be announced when A1 is graded |
||||

4 | AVL Trees – Remove | |||||

5 | Workshop: Finding and using code online |
slide show (see below) | ||||

6 | NO CLASS |
Non-Instructional Day |
||||

7 | Heaps, Heapsort | Kevin Sarah |
§ 2.3.2, Ch 6 Online materials |
|||

8 | MergeSort | Ethan Emilio |
§ 2.3 Online materials |
|||

9 | B-Trees-Overview, Add | Eric Keith |
Ch 23 Online materials |
|||

10 | B-Trees –Delete | Alex Matt |
23.2 23.3 23.4 Online materials |
|||

11 | Skip Lists | Ben Sarah |
Ch 25 Online materials |
|||

12 | Graphs: Overview Breadth-first search Depth-first search |
Kevin Minah |
Ch 26 Online materials |
|||

13 | Graphs Single-source Shortest Path (Dijkstra's algorithm) |
Emilio Matt |
Ch. 26 Online materials |
Minah: Skip List | Minah: Djikstra's Alg. | |

14 | Minimum Spanning Tree (Prim's, Kruskal's algorithms) |
Eric Ethan - BOTH Kruskals AND Prim's |
Ch. 26 Online materials |
|||

15 | Graphs: All-pairs Shortest Path (Floyd-Warshall) |
Ben Roberto |
Ch 24 Online materials |
|||

16 | Hash Tables- Open Addressing |
Keith Minah |
Ch. 11 Online materials |
|||

17 | Hash Tables- Hashing With Chaining, Good Hashing Algorithms |
Ch. 11 Online materials |
||||

18 | Dynamic Programming | Alex Daniel |
Ch. 15 Online materials |
|||

19 | Greedy Algorithms | Daniel Roberto |
Ch. 16 Online materials |
|||

20 | Minah: Greedy | Minah: Dynamic | ||||

21 | BRING YOUR WORK TO CLASS |
|||||

22 | Term Project Presentations |
Term Project Presentations |

Instructor's Handout on AVL trees (including both Add
and Remove)

Instructor notes on AVL tree lecture
(including a list of errors in the code)

- Exercises: Add (These are included in the above handout)
- Exercises: Remove (These are included in the above handout)
- Starter Project for implementing an AVL tree (Note: this is NOT guaranteed to be "compatible" with the lecture notes)

Other Online resources: