Consider the reference string
012301401234
If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are _______ and ______ respectively.
A. | 10, 9 |
B. | 9, 9 |
C. | 10, 10 |
D. | 9, 10 |
Option: D Explanation : Click on Discuss to view users comments. |
Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below : With reference to current allocation, is system safe ? If so, what is the safe sequence ?
Process | Max.Need |
Current
Allocation
|
P1 |
8 |
3 |
P2 |
9 |
4 |
P3 |
5 |
2 |
P4 |
3 |
1 |
A. | No |
B. | Yes, P1P2P3P4 |
C. | Yes, P4P3P1P2 |
D. | Yes, P2P1P3P4 |
Option: C Explanation : Click on Discuss to view users comments. |
If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are :
98, 37, 14, 124, 65, 67
A. | 320 |
B. | 322 |
C. | 321 |
D. | 319 |
Option: C Explanation : Click on Discuss to view users comments. |
In UNIX, _________ creates three subdirectories : ‘PIS’ and two subdirectories ‘progs’ and ‘data’ from just created subdirectory ‘PIS’.
A. | mkdir PIS/progs PIS/data PIS |
B. | mkdir PIS progs data |
C. | mkdir PIS PIS/progs PIS/data |
D. | mkdir PIS/progs data |
Option: C Explanation : Click on Discuss to view users comments. |
A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates 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 .............. criteria.
A. | Priority scheduling |
B. | Round Robin Scheduling |
C. | Shortest Job First |
D. | FCFS |
Option: B Explanation : Click on Discuss to view users comments. |