CS 170
Efficient Algorithms and Intractable Problems

For the past two years, I’ve been involved with CS 170, a course leading students to the intersection of CS Theory and math. I am currently a veteran uGSI (Student Instructor). During the 2020-2021 semesters, I co-produced a series of weekly lectures covering the core content from the perspective of recent students. You can find the playlist on the course website under mini-lectures with a Berkeley email.

CS 61A
The Structure and Interpretation of Computer Programs

CS 61A was the first class I ever helped teach my freshman year of college. I was an Academic Intern for the Spring 2019 iteration.

In June 2020, some of us at Klesis offered an unofficial CS 61A preview course for 40+ incoming underprivileged students. The course ran for a full month with live weekly lectures, office hours, and problem sessions. I served as a section leader and lectured part of the course.

In July 2021, I was a part of the CS 61A preview course again as one of the project managers. Here is a link to the program.

CS 70
Discrete Mathematics

In 2019, I graded problem sets and staffed office hours for CS 70.