Articles by Miguel Hernandez


Re-learning How to Learn

After doing some stuff these past few months as described in my latest OSSU blog post, I decided to invest some time into learning how to learn. I already have some working knowledge about learning, but I want to refresh myself with the most up-to-date information. I compiled a list …



OSSU Blog 2 - Update from Feb 1, 2026 until May 1, 2026 (pinned)

It’s been about 3 months since my last blog update. I will share what I’ve done these last three months, and what my plan is for the next few months. What I’ve Done Update The Nostalgia Machine to have years 2016 - 2025. My PR on GitHub Continued …



SPD Course Review

Here is my review of the Systematic Program Design course. I will start by giving a background about myself, then discuss why I’m taking this course and why I believe it’s important, my overall thoughts on the course, then some background of the course and what it’s …



SPD First Half Modules

Here are the SPD's first half module summaries. Module 1a - Beginning Student Language This module introduces a specially designed programming language called the Beginning Student Language. The language is small and simple. Its simplicity allows us to spend more time on learning the design method which is the real focus …



OSSU Blog 1 - Progress Update from October 18, 2025 until January 24, 2026 (pinned)

I'm happy to share that I have made good progress on OSSU since I started back in October 2025! In this blog post, I will be briefly discussing the courses I took so far, along with a break-down of the time I took to complete them. Then I will talk …



Systematic Program Design: TA Solver Project

Problem 1 was straight-forward, since it's basically the same problem as max-exits-to from the problem bank of this week that I had already solved. However, I adapted it to operate on all nodes of a network, that way we can take care of disconnected components. Going through the 5 step …



Intro to CS: Lecture 26 (Final Lecture) - List Access, Hashing, Simulations, and Wrap-Up

Topics: Extras: lists in memory, hashing, simulations, wrap-up Looking at lists, and how they’re actually implemented in memory. Looking at dictionaries, and how they are implemented in memory using hash tables. Going over simulations. Simulations Topic useful for many domains Computationally describe the world using randomness One very important …



Intro to CS: Lecture 25 - Plotting

Topics: Visualization Library Plots help us visualize data. I sped through the video because it didn’t seem useful to me. I don’t see myself using the plot library anytime soon. And if I do, I’ll just read the documentation and examples on stack overflow or something to …



Intro to CS: Problem Set 5

Took about 2.22 hours, got tripped up a bit on extract_end_bits and reveal_image scaling parts. Here is my code: https://github.com/miguelHx/intro-to-cs-mit-problem-sets/blob/main/1_ps5/ps5.py There was an easier way to do the extract end bits but I ended up doing a different way and …



Intro to CS: Lecture 23 - Complexity Classes Examples

Topics: String and List Examples, Analyzing Complexity, Search: indirection, linear search, bisection search This lecture we are looking at more code and analyzing their complexities. Be careful what the inputs are and whether or not they contribute to the complexity. Went over a bunch of examples, it was a good …