ISRO Scientist or Engineer Computer Science 2015

If there are 32 segments, each size 1 k bytes, then the logical address should have

In a lottery scheduler with 40 tickets, how we will distribute the tickets among 4 processes P1, P2, P3 and P4 such that each process gets 10%, 5%, 60% and 25% respectively?

Suppose a system contains n processes and system uses the round-robin algorithm for CPU scheduling then which data structure is best suited ready queue of the processes

A hard disk system has the following parameters:
Numberoftrack = 500
$$\frac{Numberof sectors}{track}$$ = 100
$$\frac{Numberof bytes}{sector}$$ = 500
Time taken by the head to move from one track to adjacent track = 1 ms
Rotation speed = 600 rpm
Whatis the average time taken for transferring 250 bytes from the disk?

At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operation were completed on this semaphore. The resulting value of the semaphore is

Increasing the RAM of a computer typically improves performance because

Consider the following program ~
main( )
{
fork() ;
fork() ;
fork() ;
}
How many new processes will be created?

Suppose two jobs, each of which needs 10 min of CPU time, start simultaneously. Assume 50% $$\frac{I}{O}$$ wait time.
How long will it take for both to complete if they run sequentially?

If a node has K children in B tree, then the node contains exactly .................... keys.

The time complexity of the following C function is (assume n > Q):
int recursive (int n) {
if (n == 1)
return (1);
else
return (recursive (n -1) + recursive (n -1));
}