This week explored algorithms including the brute force method by performing an exhaustive search. We also learned about two primary strategies to transverse a graph. These two methods were depth first search and breadth first search. Of the two I am more comfortable with the depth first search. I find it somewhat more simple to code an algorithm that performs a depth first search. When coding for the breadth first search I found I had to keep track of the queue and in the homework I had to keep track of what permutation produced the optimal path. I also learned about the divide and conquer strategy and how to use the master theorem to calculate time complexity. We will also have our midterm this week so I will need to review and solidify my understanding of the concepts presented in these first three weeks.
This week primarily consisted of the Mid term which encompassed the first three weeks of learning. So far, this class has been challenging, but I am beginning to grasp some of the main concepts. I find that doing a daily review of the materials I have learned helps me to feel a little more confident that I understand. I feel that the main ideas have been computing the time complexity of the algorithm and getting familiar with some established algorithms for solving common problems. I will continue to study the new material and review previous materials to continue to improve.
Comments
Post a Comment