I am a 4-time TA (and a Lead TA for the most recent semester) for CS4820: Analysis of Algorithms, a core CS course that covers major algorithm design techniques, including greedy algorithms, divide and conquer, dynamic programming, and network flow, alongside computability theory, NP-completeness, and strategies for tackling intractable problems.

In this role, I supported over 300 students by holding office hours, leading recitation sections, recording prelim review videos, and grading assignments and exams. 

My contributions were recognized with the Faculty-Nominated CS Course Staff Exceptional Service Award.