When you’re done
When you’re done with this week’s material, please take Quiz 14. To prepare, you should watch all video lectures, and complete the readings in the textbook. The quiz will focus primarily on this week but may also have some questions relating to material in the previous week.
At the end this week’s topics, you’ll find “comprehension check” questions. These questions will help you to prepare and self-assess readiness for the quiz.
You will have 30 minutes to complete the quiz. You may make two attempts and your higher score will prevail. Good luck!
This week:
- Review of trees
- Minimum spanning tree
- Prim’s algorithm
- Kruskal’s algorithm
Last week:
- Shortest path
- Dijkstra’s algorithm
- Bellman-Ford algorithm
- Network flows
- Max flow - min cut
- Ford-Fulkerson algorithm
- Edmonds-Karp algorithm
Copyright © 2023–2025 Clayton Cafiero
No generative AI was used in producing this material. This was written the old-fashioned way.