Question: QUESTION 17 Which page replacement policy is the worst? First In First Out. Most recently used Belady's optimal policy Least recently used QUESTION 18 Let

 QUESTION 17 Which page replacement policy is the worst? First In

QUESTION 17 Which page replacement policy is the worst? First In First Out. Most recently used Belady's optimal policy Least recently used QUESTION 18 Let N be the number of processes and M the number of types of resources in the system. What is the computational complexity of a deadlock detection algorithm? Worse than O(M+N). O(M) O(N) QUESTION 19 What is the relationship between the turnaround time T and waiting time W of the same process? W=T These times are unrelated. W T

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!