CST 370 Weekly Journal #7
Weekly Journal This week, I focused on learning and practicing more algorithms, which included the Prim’s algorithm for finding Minimum Spanning Trees, Floyd’s algorithm for shortest paths in weighted graphs, and Warshall’s algorithm for transitive closure. In addition, I did a few exercises to help me understand more about how to work with graphs, minimize network costs, and identify nodes. Furthermore, I learned how to do dynamic programming problems like the Coin-Row and Coin-Collecting by doing some more exercises and then learned to develop relations and trace optimal paths to increase the collected values. Additionally, I practiced Counting Sort, which introduced me to a non-comparison-based sorting method that relies on frequency counts. In conclusion, this week tied together many key concepts I’ve learned throughout the course, and this being the final week, I've come to realize this course flew by really fast, but I've learned a lot at the end of it all. It gave me a...