ISRO CS 2016

At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and xV operations were completed on this semaphore. If the new value of semaphore is 5 ,x will be

Frames of 1000 bits are sent over a 10 ^ 6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of bits (I) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.

The message 11001001 is to be transmitted using the CRC polynomial x³ + 1 to protect it from errors. The message that should be transmitted is:

In a token ring network the transmission speed is 10⁷ bps and the propagation speed is 200 meters/ μs. The 1-bit delay in this network is equivalent to:

In Ethernet CSMA/CD, the special bit sequence transmitted by media access management to handle collision is called

What is the output of this C code?

#include
void main()
{
int k=5;
int *p=&k;
int **m=&p;
printf("%d %d %d",k,*p,**m);
}

A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is:

In which one of the following page replacement policies, Belady's anomaly may occur?

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:

The necessary condition for using binary search in an array is :-