Decided to take intro to CS using Python from MIT. Yes, this is easy basic stuff and my ego is nudging me to not proceed because “I already know this stuff”. And I feel like I’m already well-versed in Python, so why am I taking this course? Mostly out …
We are presented with a new data structure for arbitrarily wide and arbitrarily deep tree structures. The example given is a file system. This structure reminds me of the Trie data structure implementation in Python, because of the list of nodes data referencing itself. In this course’s terms, it …
Since the start of my post-high-school learning journey, I've been interested in metalearning. That is, learning about learning. It's such an important topic because it is used throughout the whole learning journey and serves as a foundation. I started back in 2015 by reading the books A Mind for Numbers …
Just completed the midterm project which was to implement Space Invaders game! It's pretty easy if you paid attention to all the lessons leading up to here. I started by doing a domain analysis using pen and paper. I also wrote out all the scenarios, such as changing direction when …
I didn’t find the first proofs to be easy. It required creative mathematical thinking using algebraic rules, some of which I have forgotten. To not waste too much time, I gave it an honest attempt for 16-32 min, then after I was surely stuck, I looked up the solution …
Module overview/summary: Binary Search Trees In this module we will investigate how the structure of data affects performance, especially when it comes to the time required to find an element in a large data store. As part of that we will discover a new self-referential form of data, the …
We start off with quantifiers. There are two of them. “For all” and “there exists”, each with their own notation. For all is an upside down A and there exists is a backwards E. We are also introduced to predicates. a predicate is a statement that contains a variable and …
This is my brain dump of week 5 of SPD. I might not go into too much detail and to understand some of it you might need to be familiar with the Racket language and have completed weeks 1-4. I haven't created blog posts about weeks 1-4 yet because I …
A proposition is a statement that is True or False. A large fraction of all math statements are of the if-then form. Learning about propositions, and propositions from propositions. The propositions from propositions can be combinations, modifications, or relations. For example, and, or, not. A implies B. A if and …
The Well Ordering Principle - Every nonempty set of nonnegative integers has a smallest element Proving by using the well ordering principle is another proof method. It can be used to prove that sqrt(2) is irrational. We are given the template for this proof method, along with some examples.