Logistics¶
For the two exams this quarter, you can expect questions to be written, design-based responses and some runtime analysis (no proofs), and there will be no mechanical questions. They are both held during lecture and will be 50 minutes long. There will be an opportunity to revise your answers after you receive feedback. The revision assignment goes towards the same exam category and is worth the same amount of points as the exam. This effectively means that you can earn back up to half of the points lost on the original exam. This exam is open-note. You may bring as many paper notes (hand-written or printed) as you want.
Midterm¶
Midterm will be held on Friday, February 7 during usual lecture time in the usual lecture room.
Topics¶
Exam content will primarily cover the following data structures:
- Arrays
- LinkedLists
- Hashmaps
- BSTs and AVL Trees
- Tries
- Data structures covered in the exercises (EX1 - EX2) and projects (P0 - P2)
Exam content will not cover:
- Heaps
And will also primarily test your understanding of:
- ADT Design
- Code Analysis
- Asymptotic Analysis
- Best/Worst Case Analysis
Resources¶
Here are the resources we released this quarter. It will have a format that approximately matches what you should expect for our actual exam on Friday:
- Midterm (24wi): pdf, solutions
- Makeup Midterm (24wi): pdf, solutions
- Midterm (23sp): pdf, rubrics
- Practice Midterm (23sp): pdf, solutions
Exams from older quarters may also be useful. However, you should not expect the format of our actual midterm to be the same as these previous midterms, and it is in your best time interest to only review the listed questions on the course website. As such, you may find them less salient during your review process, but still nice to have if you’re seeking some extra practice.