This week marked the start of a new class in my CSUMB journey. The class is CST 370 Design and Analysis of Algorithms. The first week got us introduced to the definition of an algorithm and how we use algorithms to solve problems. I do feel that the material is more challenging than some of the other classes I have previously taken and so intend to spend more time learning the concepts in this class. One of the aspects I found interesting in this class is the inclusion of a few puzzles that involved determining an algorithm that solves the given problem. I enjoy trying to solve them because they are like brain teasers that force me to think of all the possible outcomes. It can be frustrating at times, but it is also very satisfying if I am able to solve them. I will continue working and reviewing the concepts presented this week as they are the foundation for future class concepts.
For the Markov code review I worked with my teammate Brandon Hoppens. My strategy for the Markov assignment was to first read through the entire prompt and ensure that I had a general idea of what the program was supposed to do. I then worked through the prompt building each method before moving on to the next. I built all of the methods and then ran the test after my initial build. I was able to pass a few of the test and failed others. I then went back to the individual tests I failed and manually debugged them. This was in contrast to how Brandon tackled the prompt as he was implementing the methods as they were needed. He worked to ensure each piece that he added worked with the existing code base. I think I would change my strategy to adopt some of his methods and use an incremental approach. I relied on building the entire program before running the first test, and I can see how on bigger projects this could lead to some frustration. The feedback I received from Brandon was ...
Comments
Post a Comment