What We cover 1. Some classic algorithms in various domains Graph algorithms Euler path, shortest path, minimum spanning trees, maximum flow, Hamilton Cycle, traveling salesman String Algorithms Exact string matching, Approximate string matching, Applications in web searching engines Scheduling problems Computational Geometry 2. Techniques for designing efficient algorithms divide-and-conquer approach, greedy approach, ynamic programming 2021/26 CS4335 Design and Analysis of2021/1/26 CS4335 Design and Analysis of Algorithms /Shuai Cheng Li Page 10 What We Cover: 1. Some classic algorithms in various domains Graph algorithms • Euler path, shortest path, minimum spanning trees, maximum flow, Hamilton Cycle, traveling salesman, String Algorithms • Exact string matching, Approximate string matching, Applications in web searching engines Scheduling problems Computational Geometry 2. Techniques for designing efficient algorithms divide-and-conquer approach, greedy approach, dynamic programming