Algorithms: Problem Solving and Graph Algorithms

This lecture covers elementary graph algorithms such as Breadth-First Search (BFS) and Depth-First Search (DFS). It also includes a midterm exam from 2016, focusing on algorithmic problem-solving techniques and asymptotic growth functions. The exam challenges students to implement algorithms, analyze recurrences, and prove tight asymptotic bounds. Additionally, it explores distance measurement between strings, considering deletions, insertions, and substitutions. Students are required to design efficient algorithms to compute the minimum number of operations needed to transform one string into another.