Teaching

Some material related to courses taught in the past

• UChicago's CMSC27200: Theory of Algorithms
• Guerilla Notes 1: Asymptotics from Spring 2024
• Guerilla Notes 2: Divide-and-Conquer from Spring 2024
• Guerilla Notes 3: Matrices, Complex Numbers, FFT from Spring 2024
• Guerilla Notes 4: Midterm Retrospective from Spring 2024
• Guerilla Notes 5: Dynamic Programming from Spring 2024
• Guerilla Notes 6: Network Flows from Spring 2024
• TTIC's 31080: Approximation Algorithms
• Notes on Sparsest Cut and Leighton-Rao
• Berkeley's CS170: Efficient Algorithms and Intractable Problems
• Guerilla Section Worksheet on the Fast Fourier Transform
• Midterm 2 Review Slides for maxflow
• Berkeley's CS61B: Data Structures
• Notes on Java inheritance
• Notes on introductory graph theory
• Notes on tree data structures
• Midterm 1 Review Guide from Spring 2017
• Midterm 1 Review Guide from Summer 2016
• Midterm 2 Review Guide from Summer 2016
• Lecture on Java design patterns