Algorithms and Data Structures

Undergraduate level introduction course to Algorithms and Data Structures taught by Prof. Purushotham Bangalore. Students learn about techniques for design and analysis of algorithms; efficient algorithms for sorting, searching, graphs, and string matching; and design techniques such as divide-and-conquer, recursive backtracking, dynamic programming, and greedy algorithms. As a student lab instructor, I helmed one lab section, held regular office hours, and designed and graded homework.