My Life In NTU
Everything In NTU
Tuesday, December 2, 2014
It's been so long since I last blogged. Anyway, I have just finished one of the toughest paper. I swear I studied for all my papers this semester. However, just like what my roomate says, study don't mean grade. Haiz..... sad. I encountered this problem once again. This paper really very tough because the paper is set in the way that test on how you apply and hence it's not in the syllabus. Die me.... How how how.... at this current rate, I am afraid I will die...... Should I go find internship to pull up my portfolio. Please advise.
Friday, June 6, 2014
Do not continue if you get rejected. Stay cool and move on
In NTU, this is the place where I first met a girl who I fell in love and have the courage to confess to her. Unfortunately, heaven has her decision, I was rejected on my first confession. The reason she gave was, " I want to concentrate on study and I don't want to reject or get rejected". I was naive or maybe blinded by love that I misunderstood what she meant. I continued and tried my best to win her over. Though I admit, her impression of me does change as can be seen from her replies, but that does not mean I have won the battle. I continue on to pursue her at the risk of my result and grades which plummeted. In the end, I still did not get her. She tried her best to avoid me, giving me excuses whenever I ask her out or plan group outings. And now in my third year, I finally would say I GAVE UP. I shall put my every heart and soul to my studies and not care about relationship. It's really sad sometime that you get rejected on your first attempt after 20+ years. I do not know how to describe. You really feel very lousy and devastated. The sour feeling you will have whenever you see her around and other couple walking past you. But it also makes you give up on finding your other half. Now I understand why people wants to stay single throughout their life. Not because they have never tried but rather they tried and failed and do not wish to get hurt or lose anything again. Forever alone.
I spoke to few elderly who are singles and I agree with what they say. Ii's okay to be single, you do not need to worry about the growing expenses because you only have one mouth to feed and that is you. With the convenience of so many religious activities and community centres, you also do not need to feel lonely. With your remaining hard earned CPF and savings, you can easily employed maid or hospice to care for you when you are old. That is because these organisation knows that you are alone and when you passed on, your belongings will go to them. That's true. I agree. So fight on all singles. Do not need to be afraid. As the saying goes, do not be afraid to be different. That shows you have personality and not a follower. Do not need to be afraid to be single throughout your life as that means you can do what you like. Freedom!1
Wednesday, April 30, 2014
Got to be the worse Semester
This Semester could be the worse semester I ever had in NTU. I have never flunk a mid term quiz in my life till now. Quite worried for the finals. Not sure if it is enough to save the two quiz that i failed. Any database Administrator out there who could really enlighten me if a person who failed two mid term quiz in school can be a DBA in the future?
Thursday, April 17, 2014
Life story from 3001
From this lab, I have learn a very useful life story from my very good friend Li Yuekang. To be great, it's nothing to do with grade and smartness. It's more on perseverance and how you manage to overcome what you do not know initially. If you have known what's going to happen then there's nothing great. It's when you do not know what is coming and you adapt to cope with it even though you may not be successful. It still makes you stand out. Yeap thanks yue kang
Wednesday, April 9, 2014
VpnToPhyPage(int vpn)
InsertToTLB(int vpn, int phyPage)
int VpnToPhyPage(int vpn)
{
IptEntry* iptPtr = hashIPT(vpn, currentThread->pid)->next;
// loop while there is any entry and is mismatch
while ((iptPtr) &&
( ((int)(iptPtr->vPage)!=vpn) ||
((int)(iptPtr->pid) != currentThread->pid) )
)
{
iptPtr = iptPtr->next;
}
// if entry found then return its physical page otherwise -1
if (iptPtr) return iptPtr->phyPage;
return -1;
}
void InsertToTLB(int vpn, int phyPage)
{
int i = 0; // entry in the TLB
static int FIFOPointer = 0;
// Find any empty space in TLB
for (; iif (machine->tlb[i].valid == false) break;
}
if (i>=TLBSize) i = FIFOPointer;
FIFOPointer = (i+1) % TLBSize;
... (Rest of code given)
}
CZ2005 LAB 3 REPORT SS2 2014
4
int clockAlgorithm(void)
int clockAlgorithm(void)
{
int phyPage;
static int clockPointer = 0;
while (! (
( memoryTable[clockPointer].valid == false) ||
( !memoryTable[clockPointer].dirty && memoryTable[clockPointer].clockCounter == OLD_ENOUGH) ||
( memoryTable[clockPointer].dirty && memoryTable[clockPointer].clockCounter == OLD_ENOUGH + DIRTY_ALLOWANCE)
) )
{
memoryTable[clockPointer].clockCounter++;
clockPointer = (clockPointer + 1) % NumPhysPages;
}
phyPage = clockPointer;
clockPointer = (clockPointer + 1) % NumPhysPages;
return phyPage;
}
InsertToTLB(int vpn, int phyPage)
int VpnToPhyPage(int vpn)
{
IptEntry* iptPtr = hashIPT(vpn, currentThread->pid)->next;
// loop while there is any entry and is mismatch
while ((iptPtr) &&
( ((int)(iptPtr->vPage)!=vpn) ||
((int)(iptPtr->pid) != currentThread->pid) )
)
{
iptPtr = iptPtr->next;
}
// if entry found then return its physical page otherwise -1
if (iptPtr) return iptPtr->phyPage;
return -1;
}
void InsertToTLB(int vpn, int phyPage)
{
int i = 0; // entry in the TLB
static int FIFOPointer = 0;
// Find any empty space in TLB
for (; i
}
if (i>=TLBSize) i = FIFOPointer;
FIFOPointer = (i+1) % TLBSize;
... (Rest of code given)
}
CZ2005 LAB 3 REPORT SS2 2014
4
int clockAlgorithm(void)
int clockAlgorithm(void)
{
int phyPage;
static int clockPointer = 0;
while (! (
( memoryTable[clockPointer].valid == false) ||
( !memoryTable[clockPointer].dirty && memoryTable[clockPointer].clockCounter == OLD_ENOUGH) ||
( memoryTable[clockPointer].dirty && memoryTable[clockPointer].clockCounter == OLD_ENOUGH + DIRTY_ALLOWANCE)
) )
{
memoryTable[clockPointer].clockCounter++;
clockPointer = (clockPointer + 1) % NumPhysPages;
}
phyPage = clockPointer;
clockPointer = (clockPointer + 1) % NumPhysPages;
return phyPage;
}
Tuesday, April 8, 2014
Saturday, April 5, 2014
Subscribe to:
Posts (Atom)