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 …
I'm sure we all agree that mastering the fundamentals is important. This is true for any discipline. In this blog post, I will be sharing my learning roadmap/plan for revisiting the fundamentals of CS/Software and discuss why I'm doing this. I will also discuss with my thoughts about …
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 …
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 …
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 …
It was a little harder than expected. 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 on google …
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 …
Graphs Module Many forms of information naturally organize themselves into trees of various kinds. But what about transit maps, wiring diagrams, the world wide web or even secret underground passages. Most of these have one or two key properties that make them be graphs instead of trees. One property is …
Topics: Complexity: measuring efficiency, timing programs, counting operations Efficiency is important. Separate time and space efficiency of a program Tradeoff between them: can use a bit more memory to store values for quicker lookup later Think fibonacci recursive vs. fibonacci with memoization Challenges in understanding efficiency A program can be …