ISRO CS 2018

Consider the following C code segment:

#include 
main()
{
    int i, j , x ;
    scanf("%d", &x);
    i = 1 ; j = 1;
    while ( i< 10 ) {
          j = j * i;
          i = i + 1;
          if (i == x) break ;
          }
 }

For the program fragment above, which of the following statements about the variables i and j must be true after execution of this program? [!(exclamation) sign denotes factorial in the answer]

Consider the following declaration :

struct addr {
     char city[10];
     char street[30];
     int pin ;
};

struct {
char name[30];
int gender;
struct addr locate;
} person , *kd = &person ;

Then *(kd -> name +2) can be used instead of

The following C program

main()
{
    fork() ; fork() ; printf ("yes");
}

If we execute this core segment, how many times the string yes will be printed ?

_______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits.

Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 ms and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?

Assume A and B are non-zero positive integers. The following code segment:

while ( A != B){
     if ( A > B ) A - = B ;
     else B - = A ; 
} 
cout << A; // printing the value of A

The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be

The following paradigm can be used to find the solution of the problem in minimum time: Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K:

Determine the number of page faults when references to pages occur in order - 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having brought earlier than page 2.(assume LRU algorithm is used)

Processes P1 and P2 have a producer-consumer relationship, communicating by the use of a set of shared buffers.

P1: repeat
    Obtain an empty buffer
    Fill it
    Return a full buffer
    forever
P2: repeat
    Obtain a full buffer
    Empty it
    Return an empty buffer
    forever

Increasing the number of buffers is likely to do which of the following?

I. Increase the rate at which requests are satisfied (throughput)

II. Decrease the likelihood of deadlock

III. Increase the ease of achieving a correct implementation