C1 Using the Least Recently Used (LRU) page replacement algorithm, complete the following page replacements using the reference string given below. Calculate the total number of the page faults....

• 
  C1
  
  Using the Least Recently Used (LRU) page replacement algorithm, complete the following page replacements using the reference string given below. Calculate the total number of the page faults.
  

• 
  C2
  
  Create an access matrix for the following scenario:
  
  
  
  • 
    Ahmad has the right to read /etc/passwd and view the grades.
    
  
  
  • 
    Mohammed has the right to view the EECS website.
    
  
  
  • 
    Students have the right to share project data and view the EECS website.
    
  
  
  • 
    Instructors have the right to change the grades.
    
  
  
  
  

Answer:

• 
  C3
  
  Draw the Gantt chart and compute the average turnaround and waiting time for the following processes using the Round Robin Scheduling algorithm. Assume the time quantum is 3 ms.
  

Gantt Chart

• 
  C4
  
  Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms?
  

1. 
   FCFS Scheduling
   
   

1. 
   SCAN Scheduling

1. 
   SSTF Scheduling
   

• 
  C5
  
  

1. 
   
   
   Create links between the files in the directory and the disk blocks using linked disk allocation technique:
   

Directory

1. 
   
   
   Write any two advantages and disadvantages of the linked disk allocation technique?