My completed coursework for 9 MIT courses taken through MIT OpenCourseWare and MIT Open Learning Library. Each repository covers the exact same coursework required of MIT students for full marks, with the exception of 6.034 which only includes the coding assignments. All solutions are my own.

*Practice exams were not graded at the time of completion (~2021). To be more precise, they were graded in 2026 using Claude Opus 4.6 with extended thinking enabled, cross-referenced with the official solutions.

**Exams were not graded at the time of completion (~2024). To be more precise, they were graded in 2026 using Claude Opus 4.6 with extended thinking enabled, cross-referenced with the official solutions.

***Quiz 1 scores were low across the board in the original Fall 2011 MIT class this course was recorded from. The course staff acknowledged this here: "The results are lower than what we thought... the mistake was on our part."

A 3D graphics engine with real-life spatial display using 2D screens and eye tracking. A childhood project built between the ages of 14 and 17 (2016-2019), inspired by Iron Man's holographic table.

Big number library with Karatsuba multiplication, Newton-Raphson division, and modular exponentiation. Applied to RSA encryption.

Balanced tree hierarchy from scratch powering a sweep line algorithm for O(n log n) wire crossing detection.

Shortest-path routing on the National Highway Planning Network with great-circle distance and KML visualization.

Bidirectional BFS on the 2x2x2 Rubik's cube using permutation group inverses.

DP implementation of the Avidan & Shamir seam carving algorithm.

Profiled an event-driven circuit simulator, identified a bottleneck in the O(n) priority queue, and replaced it with a min-heap built from scratch.

Forward and backward propagation with sigmoid activation through multi-layer networks.

Weighted voting, weight updates based on classification error, and best-classifier selection. Applied to congressional voting data.

Complete implementation of the uninformed-to-informed search taxonomy with heuristic verification.

CSP solver with forward checking and BFS-style singleton domain propagation.

k-NN classification using Hamming and Euclidean distance, and a Shannon entropy function for decision tree split quality.

Adversarial game search using negamax-style alpha-beta pruning.

Recursively builds AND/OR goal trees from production rules with pattern-variable unification.

Stochastic simulation of bacterial growth and natural selection with Monte Carlo trials and 95% confidence intervals.

Polynomial regression on US temperature data with train/test split demonstrating overfitting.

Monte Carlo simulation of robot vacuum cleaners with a multi-level OOP hierarchy and stochastic faulty robot variant.

Graph-based shortest path across the MIT campus using DFS with branch-and-bound pruning and an outdoor distance constraint.

News feed filtering with a deep OOP trigger hierarchy implementing strategy and composite design patterns, with a Tkinter GUI.

Recursive permutation generator connected to two encryption systems with class inheritance.

Word game with wildcard vowel substitution, hand management, and multi-hand orchestration.

I'd be very happy to discuss anything related to MIT OCW. Reach me at benjamin.jazayeri@gmail.com.