Reality is optional.

https://pika.art/about

• Course dev for CS381 Analysis of Algorithms: Developing homework/exam problems problems for the course spanning topics like dynamic programming, greedy, divide & conquer, etc.

• Teaching assistant for CS381: conducting office hours and collab hours for students to learn, discuss and collaborate over hoemworks.

• Class taken by 400+ students at Purdue and regarded as the hardest undergraduate CS class at Purdue.

• Working with Dr. Simina Branzei, Phd student Reed Philips.

• Researching reinforcement learning strategies applied to repeated fair division and Stackelberg games.

• Investigated strategy convergence and equitable outcomes in the repeated ‘cake-cutting’ problem for two learning agents.

• Designed and implemented simulations to validate algorithms, achieving observations on strategy outcomes.

• Course dev for CS182 Discrete Math: Prepared problems for quizzes and other graded material for the course

• Conduct Practice Study Observation classes weekly as well as office hours

• Class taken by 800+ students in Purdue