Course reviews and general thoughts here.
Fall 2021
- TA 15-451
- 07-300 Research and Innovation in Computer Science
- 11-711 Advanced Natural Language Processing
- 15-195 Competition Programming I
- 15-411 Compiler Design
- 15-854 Special Topics in Theory: Advanced Approximation Algorithms
- 15-859 Special Topics in Theory: Algorithms for Big Data
Spring 2021
- TA 15-251
- 10-315 Introduction to Machine Learning
- 15-259 Probability and Computing
- 15-260 Statistics and Computing
- 15-354 Computational Discrete Mathematics
- 15-451 Algorithm Design and Analysis
- 15-855 Graduate Computational Complexity Theory
Fall 2020
- TA 15-251
- 15-210 Parallel and Sequential Data Structures and Algorithms
- 15-213 Introduction to Computer Systems
- 15-356 Introduction to Cryptography
- 15-455 Unergraduate Complexity Theory
- 84-104 Decision Processes in American Political Institutions
- 98-317 Hype for Types
Spring 2020
- TA 15-122
- 15-150 Principles of Functional Programming
- 15-251 Great Ideas in Theoretical Computer Science
- 15-252 More Great Ideas in Theoretical Computer Science
- 15-281 Artificial Intelligence: Representation and Problem Solving
- 21-268 Multidimensional Calculus
- 80-100 Introduction to Philosophy
Fall 2019
- 07-128 Freshman Immigration Course
- 07-131 Great Practical Ideas in Computer Science
- 15-051 Discrete Math Primer
- 15-122 Principles of Imperative Computation
- 15-151 Mathematical Foundations of Computer Science
- 16-161 Robotics Freshman Seminar: AI and Humanity
- 21-241 Matrices and Linear Transformations
- 76-101 Interpretation and Argument
- 99-101 Computing at Carnegie Mellon
Formatting mostly stolen from here.