It seems reasonable to service all the requests close to the current head position before moving the head far away to service other requests. This assumption is the basis for…

DESCRIPTION:Disk Scheduling is the process of deciding which of the cylinder request is in the ready queue is to be accessed next. The access time and the bandwidth can be…

Concept:Allocate the smallest hole that is big enough. We must search the entire list, unless the list is ordered by size. This strategy produces the smallest left over hole. SOURCE…

ALGORITHM:Step 1: Read all the necessary input from the keyboard.Step 2: Pages – Logical memory is broken into fixed – sized blocks.Step 3: Frames – Physical memory is broken into…

ALGORITHM:Here we select the page that will not be used for the longest period of time.1. Start2. Read Number Of Pages And Frames3. Read Each Page Value4. Search For Page…

ALGORTHIM:1. Start2. Read Number Of Pages And Frames3.Read Each Page Value4. Search For Page In The Frames5. If Not Available Allocate Free Frame6. If No Frames Is Free Repalce The…

ALGORITHM :1. Start 2. Declare the size3. Get the number of pages to be inserted4. Get the value5. Declare counter and stack6. Select the least recently used page by counter value7.…

Concept: The FIFO page-replacement algorithm is easy to understand and program. However, its performance is not always good. On the one hand, the page replaced may be an initialization module…

Concept:(Bankers algorithm) When a new process enters a system, it must declare the maximum number of instances of each resource type it needed. This number may exceed the total number…

#include #include struct st { char dname[10]; char sdname[10][10]; char fname[10][10][10]; int ds,sds[10]; }dir[10]; void main() { int i,j,k,n; clrscr(); printf("enter number of directories:"); scanf("%d",&n); for(i=0;i