PGM 4.txt

#include<stdio.h>
#include<math.h>

fcfs()
{
 int queue[20],n,head,i,diff,seek;
 printf("\nEnter the size of queue:");
 scanf("%d",&n);
 printf("Enter the queue:");
 for(i = 1;i <=n;i++)
   {
      scanf("%d",&queue[i]);
   }
 printf("Enter the intial head position:");
 scanf("%d",&head);
 queue[0] = head;
 for(i = 0;i <n;i++)
   {
    diff = abs(queue[i+1] - queue[i]);
    seek+= diff;
   }
 printf("\nSeek time = %d",seek);
 printf("\n");
}

scan()
{

   int a[20],b[20],n,i,j,temp,p,s,m,x,t=0;
   printf("\nEnter head position:");
   scanf("%d",&a[0]);
   s=a[0];
   printf("Enter previous head position:");
   scanf("%d",&p);
   printf("Enter max track:");
   scanf("%d",&m);
   printf("Enter number of processes:");
   scanf("%d",&n);
   printf("Enter the queue:");
   for(i=1;i<=n;i++)
   {
    scanf("%d",&a[i]);
   }
   a[n+1]=m;
   a[n+2]=0;
   for(i=n+1;i>=0;i--)
   {
    for(j=0;j<=i;j++)
    {
     if(a[j]>a[j+1])
     {
      temp=a[j];
      a[j]=a[j+1];
      a[j+1]=temp;
     }
    }
   }
   for(i=1;i<=n+1;i++)
   {
    if(s==a[i])
    x=i;
   }
   j=0;
   if(s<p)

 {
   for(i=x;i>0;i--)
   {
    t+=(a[i]-a[i-1]);
    b[j++]=a[i];
   }
   t+=a[x+1]-a[0];
   b[j++]=a[0];
   for(i=x+1;i<n+1;i++)
   {
    t+=(a[i+1]-a[i]);
    b[j++]=a[i];
   }
   b[j++]=a[i];
  }
  else
  {
   for(i=x;i<n+2;i++)
   {
    t+=(a[i+1]-a[i]);
    b[j++]=a[i];
   }
   t+=a[n+2]-a[x-1];
   b[j++]=a[n+2];
   for(i=x-1;i>1;i--)
   {
    t+=(a[i]-a[i-1]);
    b[j++]=a[i];
   }
   b[j++]=a[i];
  }
  printf("\nTotal seek time:%d",t);
  printf("\n");
}

cscan()
{
            int queue[20],n,head,i,j,k,seek=0,max,diff,temp,queue1[20],queue2[20],temp1=0,temp2=0;
            float avg;
            printf("Enter the max track\n");
            scanf("%d",&max);
            printf("Enter the head position\n");
            scanf("%d",&head);
            printf("Enter the size of queue\n");
            scanf("%d",&n);
            printf("Enter the queue\n");
            for(i=n;i>=1;i++)
            {
                        scanf("%d",&temp);
                        if(temp>=head)
                        {
                                    queue1[temp1]=temp;
                                    temp1++;
                        }
                        else
                        {
                                    queue2[temp2]=temp;
                                    temp2++;
                        }
            }
            for(i=0;i<temp1-1;i++)
            {
                        for(j=i+1;j<temp1;j++)
                        {
                                    if(queue1[i]>queue1[j])
                                    {
                                                temp=queue1[i];
                                                queue1[i]=queue1[j];
                                                queue1[j]=temp;
                                    }
                        }
            }
            for(i=0;i<temp2-1;i++)
            {
                        for(j=i+1;j<temp2;j++)
                        {
                                    if(queue2[i]>queue2[j])
                                    {
                                                temp=queue2[i];
                                                queue2[i]=queue2[j];
                                                queue2[j]=temp;
                                    }
                        }
            }
            for(i=1,j=0;j<temp1;i++,j++)
            queue[i]=queue1[j];
            queue[i]=max;
            queue[i+1]=0;
            for(i=temp1+3,j=0;j<temp2;i++,j++)
            queue[i]=queue2[j];
            queue[0]=head;
            for(j=0;j<=n+1;j++)
            {
                        diff=abs(queue[j+1]-queue[j]);
                        seek+=diff;
            }
            printf("Total seek time is %d\n",seek);
}

void main()
{int c;
 printf("\nMENU\n\n1)FCFS\n2)SCAN\n3)CSCAN\n4)EXIT\n\n");
 printf("Enter your choice:");
 scanf("%d",&c);
 switch(c)
 {case 1:fcfs();
         break;
  case 2:scan();
         break;
  case 3:cscan();
         break;
  case 4:break;
 }
}