**Ans : Option B**

Solution :

Questions : 4

QID : 271GATE-2008, 2M

A process executes the following code:

for (i = 0; i < n; i++) fork();

The total number of child processes created is

Solution :

QID : 269GATE-2008, 2M

The P and V operations on counting semaphores, where s is a counting semaphore, are defined as follows:

P(s) : s = s - 1;

if (s < 0) then wait;

V(s) : s = s + 1;

if (s <= 0) then wakeup a process waiting on s;

Assume that Pb and Vb the wait and signal operations on binary semaphores are provided. Two binary semaphores Xb and Yb are used to implement the semaphore operations P(s) and V(s) as follows:

P(s) : Pb(Xb);

s = s - 1;

if (s < 0) {

Vb(Xb) ;

Pb(Yb) ;

}

else Vb(Xb);

V(s) : Pb(Xb) ;

s = s + 1;

if (s <= 0) Vb(Yb) ;

Vb(Xb) ;

The initial values of Xb and Yb are respectively:

Solution :

QID : 270GATE-2008, 2M

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?

Solution :

QID : 268GATE-2008, 1M

The data blocks of a very large file in the Unix file system are allocated using

Solution :

Inode uses single indirect block and double indirect block to extend the file size.

Year | Key | Organized by |
---|---|---|

2019 | Key | IIT Madras |

2018 | Key | IIT Guwahati |

2017(Set1) | Key | IIT Roorkee |

2017(Set2) | Key | IIT Roorkee |

2016(Set1) | Key | IISc |

2016(Set2) | Key | IISc |