This week’s module focused on algorithm design techniques and graph algorithms. I learned how divide-and-conquer is applied in QuickSort, including how pivot selection affects performance and how the Median-of-Three strategy helps avoid worst-case scenarios. I also studied decrease-and-conquer through binary search and understood why sorting first can improve efficiency. In addition, I learned about Directed Acyclic Graphs (DAGs) and topological sorting. Using Kahn’s algorithm, I practiced calculating in-degrees, identifying source vertices, and detecting cycles. The quizzes and HW4_2 helped reinforce how algorithm steps and data structures like queues affect the final output order.
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