ABOUT
HOW IT WORKS
FOLLOW US
FEEDBACK
Discover useful tools, tutorials, and helpful resources organized by category
6.5840 is MIT's graduate course on distributed systems, formerly numbered 6.824, and the course site for Spring 2026 is public. It presents abstractions and implementation techniques for engineering distributed systems, with fault tolerance, replication and consistency as the major topics. The course combines lectures, readings and five programming labs, and much of the class consists of studying and discussing case studies of distributed systems. The site publishes the schedule, the labs and past exams, and links the course sites of earlier years back to 2000. Substantial programming experience is recommended for the labs, so it suits developers who want to learn by building.
This is the full lecture video series for MIT’s undergraduate algorithms course, taught by Charles Leiserson and Erik Demaine. The course covers a wide spectrum of fundamental algorithmic topics: from basic sorting algorithms, asymptotic analysis, divide & conquer, data structures (trees, hashing), dynamic programming, graph algorithms (shortest paths, MST), to more advanced topics in the later lectures. Though a couple of lectures (20 and 21) are not available in video form, most sessions are online, along with supporting readings, problem sets, and course materials. Altogether it’s a deeply valuable resource for anyone who wants a rigorous, structured introduction (or refresher) to algorithmic theory and practice.
The Missing Semester of Your CS Education (MIT) is a course designed to teach the “missing” practical tools that many computer science curricula skip: mastering the shell, version control (Git), editors like Vim, scripting, debugging, profiling, data wrangling, security, and more. It’s meant to smooth out the friction engineers often face when they spend tons of time fighting their tools instead of using them.