All Operating Systems questions

One or more correct

• ABanker's algorithm is used to prevent deadlocks
• BDeadlock formation can be prevented by ensuring that the hold and wait condition is not allowed
• CAn assignment edge in a resource allocation graph is marked from a process to a resource
• DA safe state guarantees that all processes can finish without formation of a deadlock

Numerical answer

One or more correct

• ATLB miss, Page table hit, Cache hit
• BTLB hit, Page table miss, Cache hit
• CTLB miss, Page table miss, Cache hit
• DTLB miss, Page table miss, Cache miss

Numerical answer

int main () {
   int i;
   for (i = 0; i < 3; i++){
      if (fork() == 0){
        continue;
      }
      break;
   }
   printf("Hello!");
   return 0;
}

Numerical answer

Numerical answer

Single correct

• AShortest Remaining Time First (SRTF) Scheduling
• BFirst Come First Serve (FCFS) Scheduling
• CRound Robin Scheduling
• DPriority Scheduling

Wait(A);
Print(*);
X = X+1;
If (X == 2)
   {
      Print($);
      Signal(B);
   }
Signal(A);
Wait(B);
Print(#);
Signal(B);

One or more correct

• A**$*###
• B**$#*##
• C**$##*#
• D***$###

Numerical answer

Numerical answer

Numerical answer

Single correct

• A$2^{21}$
• B$2^{20}$
• C$2^{22}$
• D$2^{24}$

int main()
{
    int x=0,i=0;
    scanf("%d",&x);
    for(i=0; i<20; i++)
    {
        x = x+20;
        printf("%d\n",x);
    }
    return 0;
}

Numerical answer

Single correct

• A9.00
• B8.75
• C6.50
• D7.50

Numerical answer

Numerical answer

Single correct

• A22
• B15
• C37
• D19

One or more correct

• ALeast Recently Used page replacement policy
• BLeast Frequently Used page replacement policy
• CMost Frequently Used page replacement policy
• DOptimal page replacement policy

One or more correct

• AAborting $P_1$ makes the system deadlock free.
• BAborting $P_3$ makes the system deadlock free.
• CAborting $P_2$ makes the system deadlock free.
• DAborting $P_1$ and $P_4$ makes the system deadlock free.

Numerical answer