World of Leion

Programming test

by on Jun.16, 2006, under General

I went to NUS for a programming test today.

I saw a primary school classmate along the way. I talked to him but he had already forgotten who I am.

Ok this test is an entry test for a job in a game industry. I applied for this post and was very interested in this post many many weeks ago. I have thought that I have failed their selection when I saw another ad inviting people to apply for this post again after the dateline.

The test was broken down into 3 parts. One part on algorithms, one for Multiple choice questions and one for short answers. The one on algorithms is the section I like best. MCQs are easy. The short answers focused more on graphics which I do not have much good knowledge on.

Here is one interesting question which I need to tell what the algorithm was doing:

 int test(int val)
{
    int n=o;
    while(val)
    {
        val &= val-1;
        n++;
    }
    return n;
}

I think this returned the floor of the log2val. But this has been verified by Jits it counts the number of one for the binary value of val. I think I forgot to do a tail case in the doubly linked list removal of node….


2 Comments for this entry

Leave a Reply

Archives