Directi Placement paper 2011( october 2nd week)

There were 30 questions and 45 minutes. Each q had 5 options.
I remember 18 of them....

1)4*4 chessboard. 2 inch each side. Ared of the circle which completely falls on black squares.
2)while(1){
wait for 1 second
if(getpid() % 2 == 0)
    fork();
}

At the end of 12th second what is the number of processes

3)Mario and Luigi play.there are 5000 coins. Each can pick up either 1,2 or 3 coins. Who picks up last loses. Mario picks first. If they both play optilamally who wins.

4) The max no. of NAND gates in
a)ABC
b)A XOR C
c)AB + BC
d)AC + D'

5)DNS operates at which layer
a)transport, application, session, network

6)difference between HTTP post and get methods.

7)for(i = 0 =; i < n; ++i)
    for(J = 0; J < (1 << N); ++J){
        IF(BITS(j) == i){
            for(k = 0; k < n; ++k){}
}
Complexity
Bits(j) calculates the number of bits of j in constant time
Options were:n*(2^n), n^2 *(2 ^ n)

7)A man ate 100 bananas in five days. Each day 6 more than previous day. What number of bananans did he eat on first day?
60, 40, 8,

8)man work day problem

9) when 123456789101112131415161718....4647484959(all numbers concatenated from 1 to 50) is divided by 16 what is the remainder?

10) What is the sum of the number of digits from 1 to 1 billion.

Dequeue in threaded environment

11)Thread safe which one
Options: Re-entrancy,mutual exclusion,...

12)Four options were given to find out which one was true.
OptionsL:kernel level thread blocked means all threads blocked
others I don't remember

13) protocol oriented which one
Options:SNA, tcp etc..

14)the sum of a right angled triangle 112. their procut is 33600. Which can be the hypoteneuse?
66,46,50,56,can't be determined.

15) Threads do not share which?
stack, message queue, thread-local variables, b+ trees, address space.

16) A person goes 1 km n of s then 2 km south then 3 km west.. etc... how far from starting point?

17)B starts 500m ahead and wins over A for 50 seconds. If A had a headstart of 80 seconds over B then A would win over B by 100m. Ratio of their speed.

18) a problem on DBMS containing inner and outer join.

Thanks to sender..