Pinned projects
View MIT 6.S081 Journey
View CPU Simulation
View Notary Office
View Thing Detector
View Hubro Backend
View To The Theath
View Wordle, CS Edition
View OrderMan
View How many bits?
View 1's Complement
View GLKM Research
View OS Problem Sets
View OS Exercises
View Medical Data Mining
View Hamming Code
View Logic and Set Theory
View Prescriptions DB
View Least Squares and QR
View ML Exercises
CodeSee all

MIT 6.S081 Journey
MIT's OS course, self-taught
I'm doing MIT 6.S081 (Fall 2021) on my own: lectures, the xv6 book and the labs on RISC-V. The repo is my checklist and notes.

CPU Simulation
Mano's Basic Computer
Mano's 16-bit Basic Computer, built from bits in Python, with a web IDE to write assembly, run it and watch the registers.

Notary Office
Fair commission sharing
Each new commission goes to the notary with the lowest revenue so far. It replaces the paper notebook an office kept this count in.

Thing Detector
Webcam object detection
A React page streams webcam frames to Django Channels, and YOLOv8 sends back boxes that get drawn over the live video.

Hubro Backend
Backend for a business game
A classroom game where student teams run a company quarter by quarter. This is its Django REST backend.

To The Theath
A wizard duel over sockets
A two-player wizard duel. Each round you strike, cast magic or defend. Pygame client, plain TCP server.

Wordle, CS Edition
Wordle with CS words
A Wordle clone with computer science words like STACK, LOGIC and CODER. Plain HTML, CSS and JavaScript.

OrderMan
Telegram orders to CSV
A Telegram bot that reads an order message, asks you to confirm it, and merges confirmed orders into daily CSV files.

How many bits?
An animated proof in Manim
Why does 8 need 4 bits when ⌈log₂ 8⌉ is 3? These slides work it out and end at n = ⌈log_b(N + 1)⌉ for any base.

1's Complement
Why the carry goes back in
In 1's complement a 1 sometimes falls off the left end, and you add it back. These slides show why that works.
Research & LabsSee all

GLKM Research
My bachelor's thesis
A greedy k-means that merges the cheapest pair of clusters. I tried two ways to improve it. Neither worked, and the thesis says why.

OS Problem Sets
I was the TA
Five problem sets with solutions for Principles of Operating Systems, Fall 2025. I was a TA, so I helped write them, in Persian.

OS Exercises
C, from pointers to fork()
C exercises from my OS course: pointers, splitting a program into files, process memory and growing a tree with fork().

Medical Data Mining
Stats on patient data
Exercises and the final exam from Prof. Marateb's course, in SPSS, Python and by hand. When does a number mean less than it seems?

Hamming Code
Error correction vs Shannon
Hamming codes sent through a noisy channel and compared with Shannon's limit, for Information Theory and Coding.

Logic and Set Theory
Group exercises in Persian
Five problem sets for Fundamentals of Logic and Set Theory, solved in Persian and typeset with XeLaTeX.

Prescriptions DB
Database lab final project
A SQL Server database for a clinic: doctors, patients, medicines and prescriptions, with queries, a function and a procedure.

Least Squares and QR
Final project, no numpy
Least squares through Cholesky and Householder QR, written by hand in plain Python on nested lists.

ML Exercises
Seventh-semester ML course
Six assignments from Dr. Alambardar's ML course, each a notebook plus written theory: regression, neural nets, SVMs, clustering, PCA.