ISRO CS 2011

What is the output of the following C code?

#include 
int main()
{
int index;
for(index=1; index<=5; index++)
{
printf("%d", index);
if (index==3)
continue;
}
}

Consider the following pseudocode: 
 

x:=1;
i:=1;
while (x ? 500)
begin
x:=2x ;
i:=i+1;
end

What is the value of i at the end of the pseudocode?
 

There are three processes in the ready queue. When the currently running process requests for I/O how many process switches take place?

The following table shows the processes in the ready queue and time required for each process for completing its job.

Process    Time
P1          10
P2          5
P3          20
P4          8
P5          15

If round-robin scheduling with 5 ms is used what is the average waiting time of the processes in the queue?

One SAN switch has 24 ports. All 24 supports 8 Gbps Fiber Channel technology. What is the aggregate bandwidth of that SAN switch?

Let T(n) be defined by T(1) = 10 and T(n + 1) = 2n + T(n) and for all integers n ≥ 1 . Which of the following represents the order of growth of T(n) as a function of

Which one of the following in place sorting algorithms needs the minimum number of swaps?

Which of the following algorithm design technique is used in merge sort?

If the page size in a 32-bit machine is 4K bytes then the size of page table is

Consider a 32-bit machine where four-level paging scheme is used. If the hit ratio to TLB is 98%, and it takes 20 nanosecond to search the TLB and 100 nanoseconds to access the main memory what is effective memory access time in nanoseconds?