My CS Journey

 This week we learned about exhaustive search including brute force string matching, traveling salesman problem and knapsack. We also learned about depth search algorithm, breadth-first search algorithm and divide and conquer. Exhaustive search, like brute force string matching, is a simple comparison algorithm that iterates through a string, for example, until a pattern is found or all positions have been exhausted. Depth first search iterates through graph data, following a branch until there are no more neighboring nodes that are unvisited. Breadth first search iterates through graph data and visits direct neighboring nodes first before moving on to other nodes. Divide and conquer algorithm takes a problem and breaks it down into smaller problems which are easier to solve. The results of subproblems and then combined into one solution. 

This week we learned about asymptotic notation, recursive and non-recursive algorithms, and brute force. The purpose of algorithm analysis is to analyze the efficiency of an algorithm using Big Oh, Big Theta and Big Omega. An example of a non-recursive algorithm would be a for loop with index ranging from 0 to n-1 which would have a time complexity of O(n)or Θ(n). Brute force is a straight forward approach to solving a problem, like a selection sort. This approach is not always the most complex or efficient but can be the easiest concept to implement.

 This week we learned how to define graphs, how to calculate the greatest common divisor (GCD) using Euclid's algorithm, and algorithm analysis. Graphs are part of the data structure in computer science, defined by a set of vertices and a set of edges. Algorithm analysis helps determine the efficiency of an algorithm. This will indicate how fast an algorithm rune and the amount of memory is required by the algorithm.  One question I asked in discord was about resubmission for hw assignments that were graded before the due date. I asked if we had to notify the TA or professor when we resubmitted the assignment.