Operating System & Computer Graphics : FCFS (First Come First Serve) Disk Scheduling

2 Replies 
/*====FCFS Disk Scheduling====*/

#include<stdio.h>
#include<conio.h>
#include<graphics.h>
void denotion();
void main ()
{
int gd=DETECT,gm,m,a[30],i,n,j=100;
clrscr();
printf("== FCFS Disk Scheduling ==\n\n");
printf("Total no of cylinders in the disk : 0 to 100\n");
printf("Enter the total no. of pending requests :");
scanf("%d",&m);
printf("Enter the pending values : ");
for(i=1;i<=m;i++)
{
scanf("%d",&a[i]);
}
printf("Enter the value where the head initially exists :");
scanf("%d",&n);
a[0]=n;
initgraph(&gd,&gm,"C://TC//BGI");
denotion();
for(i=0;i<=500;i+=5)
{
setcolor(WHITE);
rectangle(i,85,5+i,95);
if(i==0)
{
outtextxy(i,70,"0");
}
if(i==50)
{
outtextxy(i,70,"10");
}
if(i==100)
{
outtextxy(i,70,"20");
}
if(i==150)
{
outtextxy(i,70,"30");
}
if(i==200)
{
outtextxy(i,70,"40");
}
if(i==250)
{
outtextxy(i,70,"50");
}
if(i==300)
{
outtextxy(i,70,"60");
}
if(i==350)
{
outtextxy(i,70,"70");
}
if(i==400)
{
outtextxy(i,70,"80");
}
if(i==450)
{
outtextxy(i,70,"90");
}
if(i==500)
{
outtextxy(i,70,"100");
}
}
setcolor(YELLOW);
setfillstyle(1,YELLOW);
rectangle(a[0]*5,85,(a[0]*5)+5,95);
floodfill((a[0]*5)+3,90,YELLOW);
delay(10);
for(i=0;i<m;i++)
{
setcolor(WHITE);
line(a[i]*5,j,a[i+1]*5,50+j);
setcolor(8);
setfillstyle(1,8);
circle(a[i+1]*5,50+j,5);
floodfill(a[i+1]*5,50+j,8);
delay(1);
j=50+j;
if(i>=1)
{
setcolor(RED);
setfillstyle(1,RED);
rectangle(a[i]*5,85,(a[i]*5)+5,95);
floodfill((a[i]*5)+3,90,RED);
delay(100);
}
}
setcolor(RED);
setfillstyle(1,RED);
rectangle(a[m]*5,85,(a[m]*5)+5,95);
floodfill((a[m]*5)+3,90,RED);
getch();
closegraph();
}
void denotion()
{
outtextxy(200,20,"== FCFS Disk Scheduling ==");
setcolor(YELLOW);
setfillstyle(1,YELLOW);
rectangle(520,380,525,390);
floodfill(523,385,YELLOW);
outtextxy(530,383,"-> Initial");
outtextxy(544,395,"position");
delay(1);
setcolor(RED);
setfillstyle(1,RED);
rectangle(520,420,525,430);
floodfill(523,425,RED);
outtextxy(530,423,"-> Request");
outtextxy(536,435,"cylinders");
delay(1);
}

Output :

Untitled

That’s All. P)
Happy C-ing!

-Aayush Shrivastava

Are you satisfied?

 

2 thoughts on “Operating System & Computer Graphics : FCFS (First Come First Serve) Disk Scheduling”

  1. Jhunly F. Faderagao

    Hi good day. I love how you did the disk scheduling algorithm. It means a lot to our case study where in we have to program all the disk scheduling algorithm. But I have a question regarding to the Total Head Movement. How can we insert the code for the total head movement I hope you understand and I hope you can help us. Thank you.

    Like

    Reply ↓
    1. Aayush Shrivastava Post author

      I’m not sure if you guys are still working on this. Extremely sorry for replying so late.
      But would love to answer all your questions!
      Can you please submit your query with your email here, so we can talk about this over an email thread where I can be of some help 🙂

      Contact Us

      Like

      Reply ↓

Leave a comment