CST370 - Module 8

What did I learn in the eighth week of CST370?

This week introduced Dijkstra's Algorithm, The lecture walked through how Dijkstra's approach works by selecting the unvisited vertex with the smallest known distance from the source, then updating the distances accordingly. This builds on the greedy technique and graph concepts from prior weeks, while focusing on finding the most efficient path in a weighted graph. The module then transitioned into a review for the Final Exam, which served as a comprehensive review over everything that we did and could be on the exam, which included revisiting the major algorithm design strategies explored across all weeks.

Overall, this final week introduced one last algorithm, while giving an exam to test us on how much we learned from the entire course.