Week 60: CST370 - Design and Analysis of Algorithms
WK01: Weekly Reflection This week's module introduced important foundations in algorithms and data structures. I learned what an algorithm is, how algorithms solve problems step by step, and how pseudocode can be used to plan a solution before writing actual code. The videos on Euclid's algorithm for GCD calculation helped me understand how a simple repeated process can solve a mathematical problem efficiently. One thing that went well this week was learning how to break problems into smaller steps. The pseudocode examples made it easier to think logically about a problem without worrying too much about programming syntax. I also learned about important problem types such as sorting, searching, graph problems, and the Traveling Salesperson Problem. These topics showed me that many computer science problems can be grouped into common categories. The data structures materials were also useful, especially the introduction to graphs and trees. I learned that graphs can represent ...