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.
Final¶
Final will be held on Friday, May 26 during usual lecture time.
Topics¶
The final covers the second half of the course. While you are unlikely to see question types explicitly from the first half of the course, you should still be familiar with the content (e.g., runtime analysis, Big-O) as they are foundational to the second half of the course.
Exam content will primarily cover the following content:
- Heaps
- Graphs (modeling, BFS/DFS, topological sort, Dijkstra’s, MSTs)
- Disjoint sets
- Sorting Algorithms
Dynamic programming and content in the last two weeks of the course will not be on the final.
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:
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:
- Final (20su, do Qs 4, 10): pdf, solutions
- Final (20su Practice, do Qs 2–3, and 5): pdf, solutions
- Final (19wi, do Qs 3–4): pdf, solutions
- Final (19sp, do pp. 8–12): solutions
Midterm¶
Midterm will be held on Friday, April 28 during usual lecture time.
Topics¶
Exam content will primarily cover the following data structures:
- Arrays
- LinkedLists
- Hashmaps
- BSTs and AVL Trees
- Tries
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:
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.
Please use this thread on Ed to ask any questions about the practice midterm. Good luck studying!