Sunday, 3 April 2016

My mother's hard disk drive has been failing - I clean installed Windows a few times and eventually the intervals between these clean installs were shortening so much that I decided it is time for this HDD to go. This is an old 500 GB HDD and my mother's desktop is a 32-bit machine with 2 GB RAM and other deteriorating and obsolete hardware. It takes at least half an hour to clean install Windows.

I suggested using my laptop's old HDD which was working even as I replaced it. My dad opened up the chassis and placed my HDD into the CPU. He secured it to the chassis with cable ties. I was a little disappointed because I did not get the chance to open the CPU up with my own hands.

I was worrying over the exercise in CS2020 problem set 6. It was the exercise, not even the main question. The exercise required me to implement Bellman Ford's algorithm for shortest path and check for negative-weight cycles. Why was I worrying? For some strange and unknown reason, I was unable to create the connection between adjacencyMatrix[i][j] and new Edge(i, j, adjacencyMatrix[i][j]). I'm glad I asked my tutor about these silly question sometimes.

I respect my tutor (although I am unable to pay 100% attention), it is his first time tutoring, and tutoring for such a challenging module, and I feel that he puts in a lot of effort to prepare for our lessons + he can answer almost all of our questions (and all of mine, of course). This motivated me to sign up for tutorship next semester - to be a senior who the juniors can count on.

That is a picture of Prof Seth holding the debrief for quiz 2. I died in this Hashing topic. I feel awful because I was not that interested in Hashing, plus it was very content-heavy. As of now, I appreciate trees and graphs more.

The most recent Friday Hacks was a ginormous one. I met many security gurus, including my senior from my previous workplace. I barely managed to understand some parts The ABCs Of XSS by Quan Yang. But I feel insecure (yes, the pun) about security because I do not have the creativity to discover these hacks..., or vulnerabilities. After this technical talk, there was a short presentation by Mr. Jayson about social engineering and other non-online methods. Then it was Q&A with Mr. Jeff and Mr. Dino. The security gurus had a ball of a time asking questions.

Recently, I find it fun to doodle on the whiteboard the Java program for the algorithms I learnt in class. I can have my program on one side, and my visualisation on the other side. As a result of these doodling, I have become more comfortable in working with graphs in Java, not just pseudo-code.

I failed to fill up the whole of the Science faculty, as my project group mates were arriving.

Labels: , , ,

0 comments | Leave a comment



About Blog

Anything geeky or nerdy shall be here!

About Me

Currently at a loss for words

My LinkedIn

Programming Languages

(in descending order)
  1. Python
  2. Ruby
  3. Java
  4. JavaScript
  5. C#
  6. Everything Else

Web Development

(in arbitrary order)
  1. HTML
  2. CSS
  3. jQuery
  4. Bootstrap, Materialize
  5. Hugo
  6. Flask
  7. Ruby on Rails


  1. Elasticsearch
  2. MongoDB
  3. Chef
  4. Ansible

The Hacks


    January to June

  • DSO: Defusing the Binary Bomb
  • DSO: Dynamic Malware Analysis
  • NUS AY15/16 Semester 1

  • CS1101S Programming Methodology
  • CS1231 Discrete Structures
  • MA1101R Linear Algebra I
  • MA1521 Calculus for Computing
  • December

  • GitHub

Contact Me


BiZiT Society
NUS Wind Symphony


NUS Computing Club
NUS Hackers


October 2015
November 2015
December 2015
January 2016
February 2016
March 2016
April 2016
May 2016
June 2016
August 2017
September 2017
October 2017
November 2017