Week 3 - CST 370

 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. 

Comments

Popular posts from this blog

Week 1 - CST 370

Week 1 - CST 438

Week 4