- Option : D
- Explanation :

There are 9 page fault in 3 frame FIFO relacement policy and 10 page fault in 3 frame FIFO relacement policy. So, option (D) is correct.

You must be logged in to post a comment.

Process | Max.need | Allocation |

P1 | 8 | 3 |

P2 | 9 | 4 |

P3 | 5 | 2 |

P4 | 3 | 1 |

- Option : C
- Explanation :

Current allocation of P_{1}P_{2}P_{3}P_{4}are 3, 4, 2, 1 which is 10 in total. We have 12 total no of resources and out of them 10 are allocated so, we have only 2 resources. There is 5, 5, 3, 2 resources are needed for P_{1}P_{2}P_{3}P_{4}respectively. So, P4 will run first and free 3 resources after execution. Which are sufficient for P3 So it will execute and do free 5 resources. Now P1 and P2 both require 5 resources each So we can execute any of them first but we will give priority to P1. The execution order will be P_{4}P_{3}P_{1}P_{2}. SO, option (C) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : C
- Explanation :

In UNIX, mkdir PIS PIS/progs PIS/data creates three subdirectories: ‘PIS’ and two subdirectories ‘progs’ and ‘data’ from just created subdirectory ‘PIS’. So, option (C) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

- Option : B
- Explanation :

A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every ‘T’ time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements Round Robin Scheduling criteria. So, option (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.