▪️CS 38 | CS 138 - Algorithms
This course covers major design techniques such as greedy approach, divide and conquer, dynamic programming, linear programming. Held weekly office hours, review recitations, and graded problem sets and exams.
▪️Ma/CS 6a | 106a - Discrete Mathematics
This is an introductory course in number theory, graph theory, combinatorics, power series and generating functions, and partitions. Held weekly office hours, prepared solutions to problem sets, graded problem sets and exams, and worked with students who need extra help.