This week, I learned how several algorithms solve optimization and graph problems, including dynamic programming for the coin-collecting and coin-row problems, Floyd and Warshall algorithms for shortest paths and transitive closure, and Prim’s algorithm for minimum spanning trees. I practiced tracing tables step by step and understanding how intermediate states evolve, which helped me better connect the concepts across topics like sorting and greedy methods. I also started reviewing for the final exam by going through the review materials and key topics such as algorithm analysis, sorting, graph algorithms, and problem-solving strategies to reinforce my understanding and identify areas that need more practice. Additionally, I watched a video review of Dijkstra’s algorithm (https://www.youtube.com/watch?v=Gd92jSu_cZk), which helped reinforce how to trace the algorithm step by step and understand how shortest paths are computed in practice.
Part 1: Review and Reflect Learning Strategy One of my strengths is making and revising a study schedule. I am good at planning my time and organizing my tasks, which helps me stay on track. I also do well at finding the main idea and important details when I read. This skill helps me understand the most important parts of the material. However, I need to improve in a few areas. Taking notes is hard for me because sometimes I write too much or miss key points. I also struggle with outlining textbooks since I am not always sure what to include. Another challenge for me is answering multiple-choice questions. Sometimes I overthink the answers and doubt myself. Part 2: Preview Time Management Skills Link: https://docs.google.com/spreadsheets/d/1KNpOCEeEtB0whGXmduCl-BP1txBSaqMnxBG3fvfV-AE/edit?usp=sharing Part 3: Project Management Basics I watched three videos about project management. They helped me understand important concepts. The first video was about the basics of project man...
Comments
Post a Comment