Design and Analysis of Algorithm
Teaching Assistantship, UT Dallas, 2023
Algorithmic analysis and design. Algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, randomized algorithms, approximation algorithms. Algorithmic techniques: backtracking, branch and bound, graph algorithms, string algorithms, computational geometry. Algorithmic complexity: time and space complexity, worst-case and average-case analysis, asymptotic notation, master theorem. NP-completeness and P vs NP.