Skip to main content

Halloween

It is a season when children enjoy collecting candles, jumping around sarcophagi, wearing dirty masks, and scaring other children(smaller/younger). TV shows are fun to watch. In the United States, children usually play snowballs during winter. Well, it is totally a different story here since children play waxballs during Halloween. Not forgetting adults, it is a season for filling stomachs with barrels of beer, bottles of wine, and gallons of coconut-fermented drinks otherwise known as tuba.


I really do not enjoy roaming around burial grounds especially during Halloween for the reasons that, you will see people shouting at each other, throwing punches, showing knives, and trying to boast their clan’s supremacy among others. The fear of ghosts is not a thing to consider here, it is the fear of being unable to withstand adults looking for troubles no matter how hard you try ignoring their fun. This is true to cheap cemeteries that are maintained by the local government unit. Company-owned cemeteries are at least safe.


It would be wise for me to stay at home and offer a prayer for my departed friends and relatives. I do not see myself behind bars in the future. Prevention is better.


Happy Halloween!

Comments

Popular posts from this blog

Architecture Complexity

Here are the items to consider: Coding to an interface Service Oriented Architecture Automated Testing Domain Driven Design Custom Data Access Layer Layered architecture Complexity is relatively equal the number of lines of code. Note that complexity is not bad. It must be justified.

Moving on

So I bought my self a 2.5″ hard drive enclosure for about 750 bucks. I wish I have my own tools for constructing a device as such. Instead of going for a 2GB USB flash drive, I chose to salvage the 30GB hard drive of an incapacitated laptop. Cool isn’t it? Though relatively slower than a typical USB flash drive, the storage capacity outweighs it. [To God] Thanks for being there always.

Bin to hex converter in 16-bit DOS assembly

Just a quick code like putting your keyboard where your brain is. There should be another way of doing this. I hate this code. start: xor al, al xor bl, bl xor cl, cl mov dl, 4 ; use dl as counter input: mov ah, 00 int 16h cmp ah, 1ch je exit cmp al, '0' jb input cmp al, '1' ja input convert: mov cl, dl dec cl ; dl - 1 sub al, 30h ; get original value shl al, cl ; place in the appropriate bit position or bl, al ; save in bl dec dl ; prepare for the next bit jnz input ; must be 4 bits cmp bl, 9 ja letter jbe number letter: add bl, 37h ; because 'A' - 37h is 0Ah jmp here number: add bl, 30h ; because '0' - 30h is 00h here: call display jmp start display: mov ah, 02h ...