Week 1 Reflections: Design & Analysis of Algorithms (CST 370)

    This week, we were introduced to (or reminded of) foundational concepts in computer science. We covered topics such as Euclid's algorithm for calculating the greatest common divisor (GCD) and explored key problem types, including graph problems, sorting algorithms, and the Traveling Salesman Problem. We also reviewed data structures like linked lists, stacks, queues, and graphs. The assignment and quiz were somewhat challenging, but it felt great to open the IDE, revisit GitHub, and dive into coding again after a long break. 

    The textbook we are using been a frustrating experience. The explanations are vague, and the lack of detailed examples makes it very challenging. It reads more like a giant essay, and I’ve had to rely on external resources just to make sense of the content. I hope it gets better as we move on. 

    Despite the challenges, I’m looking forward to a great semester!