Liam's Computer Science Learning Journal

   Week 7 Learning Recap           Week 7 of CST370 was a reinvigorating volley of algorithmic delights. I found myself looking forward to the programming assignment during this week’s lectures and puzzles. I always love actionable steps, the pathway to victory as my Calculus professor once called it. As the shadow of the final exam looms ever closer, I have been quite intentional about fully absorbing the lecture, example, and textbook excerpt before moving onto the next concept.           This week's algorithms folded very nicely into each other throughout the module. Counting sort using frequency and distribution to place in the index was the perfect simple intro to stack Radix's LSD method of going digit by digit.  The coin collection problem was my first "alright pausing on this and clocking back into work" moment, but upon returning became quite clear--I appreciate that dynamic programming is tactile and ca...

 Week 6 Learning Recap           Week 6 of CST370 revealed many clear-cut rules and hands-on navigation tools for the handful of data structures covered, including but not limited to: balanced binary search trees (AVL and 2-3 trees), heaps, and hash tables. In the fight to not feel overwhelmed amid the many moving pieces we deal with in CST370, I greatly appreciate how each structure from this week has a strict internal rule set with an accompanying specific algorithmic repair process when those rules are violated. In theory, that's how all algorithmic concepts should be, but I found working through the example problems to be more tactile and logical than I perhaps expected. This week proved to be a bit more like a Lego set and less abstract than some attempts have proven to be in prior modules. It could just be that the nearness of the next exam looms and needing to absorb the material sufficiently now for the exam is not lost on me. The heap and...

  Week 5 Learning Recap          On the other side of our first midterm exam, I'm now attempting to absorb the material at a more demonstrable level. I was mindful of ensuring practical understanding before continuing my traversal of the week's offerings of Quick Sort, binary trees, Decrease & Conquer, Insertion Sort, Topological Sort, and Transform & Conquer--among other puzzles and detours. A sizeable gap in my exam performance revolved around analyzing time complexities for new algorithms and programs I hadn't encountered yet. This week's module offered moments to rectify that trouble right away by analyzing time costs calculations with the Quick Sort worst-case and best-case T(n) equations.           Following along to Professor Jia's explanation of Quick Sort and w riting out the recursion tree by hand helped clarify why the linear work per level accumulates logarithmically--in the most favorable case at least. Bin...