Simulate MVT

  #include<stdio.h>

#include<conio.h>
#include<math.h>
void main()
{
int mm,osm,size[1000],i,n,rem,part;
 clrscr();
 printf("Enter Total Memory Size:");
 scanf("%d",&mm);
 printf("\nEnter OS Size:");
 scanf("%d",&osm);
 mm=mm-osm;
 printf("\nRemaming memory for use is:%d",mm);
 while(1)
{
 printf("\nEnter size of process  : ");
 scanf("%d", &size[i]);
 if (size[i] <= mm)
 {
 printf("\nProcess is allotted\n");
 mm=mm-size[i];
 }
 else if(mm<=0){
 break;
 }
 else
 printf("\nProcess is blocked\n");
}
 printf("Total External fragmentation : %d\n", mm);
 getch();
}

Comments

Post a Comment

Popular posts from this blog

CLOOK DISK SCHEDULING

 #include <stdio.h> #include <stdlib.h> int main() {     int queue[20], n, head, i, j, seek_time = 0, diff, max, min, temp, range;     float avg_seek_time;     printf("Enter the number of requests: ");     scanf("%d", &n);     printf("Enter the queue of disk requests: ");     for(i = 0; i < n; i++)         scanf("%d", &queue[i]);     printf("Enter the initial head position: ");     scanf("%d", &head);     queue[n] = head;     n++;     for(i = 0; i < n; i++)     {         for(j = i; j < n; j++)         {             if(queue[i] > queue[j])             {                 temp = queue[i];                 queue[i] = queue[j];   ...
Read more

LOOK Disk Scheduling

#include <stdio.h> #include <stdlib.h> int main() {     int n, i, j, head, seek_time = 0, prev, curr;     printf("Enter the number of requests: ");     scanf("%d", &n);     int requests[n];     printf("Enter the requests: ");     for(i = 0; i < n; i++) {         scanf("%d", &requests[i]);     }     printf("Enter the initial head position: ");     scanf("%d", &head);     prev = head;     for(i = 0; i < n; i++) {         int closest = 999999;         for(j = 0; j < n; j++) {             if(abs(requests[j] - prev) < closest) {                 closest = abs(requests[j] - prev);                 curr = requests[j];             }       ...
Read more