Finding Big O from non-standard recurrence relations without master method

A questionable proof to find recurrence relations for most T(n) = aT(n/b) + O(k). I also explain some intuition behind recursion trees. Probably useful for my CS2040 (DSA) pals.

📆 05 Mar '23 | 📋 Essay CS2040 Math

Recovering Linux from initramfs

If you boot into initramfs, chances are that your hard disk has some memory error. This essay talks about how to fix it.

📆 06 Dec '22 | 📋 Linux Tutorial

How to choose which OS to boot into with systemd-boot

Guide for Pop!_OS or systemd-boot users to configure the menu to choose which OS to boot into.

📆 13 Sep '22 | 📋 Linux Tutorial

CG2111A - Mod Review

Reviewing the highlight module for Year 1 Computer Engineering Freshies - Engineering Principles and Practice 2

📆 17 Jul '22 | 📋 NUS Modreview Essay

CG1111A - Mod Review

A module review for every CEG freshie's very first CEG mod - Engineering Principles and Practice I

📆 16 Jul '22 | 📋 NUS Modreview Essay