CST370 - Module 1

What did I learn in the first week of CST370? 

This is the first week within CST370, introducing us to algorithm design and analysis with the book 'Introduction to The Design and Analysis of Algorithms - Anany Levitin'. The course began with what algorithms are and their corresponding framework, data structures, and ways in resolving problems through them, for example, the Euclid's algorithm is meant to help with computing the greatest common divisor through understanding how a problem can be solved in multiple ways based on their efficiencies. Therefore, when compared to the consecutive integer checking method and the middle-school prime factorization method, the Euclid algorithm requires both correctness and careful consideration when it comes to both efficiency and practical application. 

The framework for algorithms on the other hand is meant to resolve problems through thorough understanding, which leads to the type of data structure and a designed algorithm that would lead to both correctness and whether it is efficient enough. Based on my own understanding thus far, this systematic methodology is crucial in resolving both math and coding problems because it determines a good algorithm based on effort and rework.

The last important thing we learned was the type of problems that can be resolved through algorithm's, which are sorting, searching, string processing, graph problems, combinatorial problems, geometric problems and numerical problems. In the end, everything we learned in the first module set the stage for how we should understand coding through both the framework and methodologies in resolving each problem.