United States
15-251, Great Ideas In Theoretical Computer Science (F22) - I teach two weekly 15-student recitations, hold office hours where I help students with course material in a 1-on-1 setting, and grade homework and exams - This class covers the following topics: automata, turing machines, graph theory, probability theory, randomized algorithms, approximation algorithms, time complexity, P vs. NP
- Collaborate with two co-instructors to teach a course on Introduction to Esoteric Programming Languages. - The class of 35 people meets once a week for an hour where students learn about, discuss, and program in various languages including INTERCAL, Piet, Befunge, Chef, and others, while exploring various programming paradigms that change the way we think about programming. - Students come away from this class with a greater appreciation for programming languages and an expanded view of various different programming paradigms. - The class is officially sponsored by CMU and students receive 3 credits for taking the class.
- Worked directly with Quant Research Mentor to implement and test various improvements to trading strategies. - Developed ETF based algorithmic trading strategy from the ground up by constructing the dataset, implementing the strategy, and backtest tuning. - Designed program to test robustness of Machine Learning trading models against adversarial datapoints.