Disk scheduling - Beginners / Lab Assignments Source Code in C

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

1208 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C Home » Beginners / Lab Assignments Home » Disk scheduling

A D V E R T I S E M E N T

Title	Disk scheduling
Author	Rathish
Author Email	rathish_kannan [at] yahoo.co.in
Description	this code show how the disk scheduling is done in OS.
Category	C » Beginners / Lab Assignments
Hits	412646
Code	Select and Copy the Code
#include<stdio.h> #include<conio.h> #include<math.h> #include<graphics.h> main() { int gd=DETECT,gm,x,y,a1,x1,y1,a,b; int req[30],head,i,k,move,n,ch,t1,t2,max,min,g[30],c,h; initgraph(&gd,&gm,"z:\tcpp\bgi"); /int req[30],head,i,k,move,n,ch,t1,t2,max,min,g[30],c,h;/ clearviewport(); printf("(1) LOOK (2) CLOOK (3) FCFS (0) EXIT Enter your choice: "); scanf("%d",&ch); while(ch) { printf("Enter the current head position: "); scanf("%d",&head); h=head; printf("Enter the number of requests: "); scanf("%d",&n); k=0; move=0; printf("Total number of cylinders: 200. "); printf("Enter the requests (1 to 200): "); req: for(i=0;i<n;i++) { scanf("%d",&req[i]); if(req[i]>200\|\|req[i]<1) { printf("Enter requests only between 1-200."); goto req; } } switch(ch) { case 1: outtextxy(270,10,"SEEK PATTERN FOR LOOK"); max=req[0]; min=req[0]; t2=1; c=0; for(i=1;i<n;i++) { max=max>req[i]?max:req[i]; min=min<req[i]?min:req[i]; } if(max<=head) t2=0; while(k<n) { t1=0; for(i=0;i<n;i++) { if(t2) { if(req[i]&&req[i]>=head) { if(req[i]<req[t1]) t1=i; if(req[i]==max) { t2=0; g[c]=1; c++; } } } else { if(req[i]&&req[i]<=head) { if(req[i]>req[t1]) t1=i; if(req[i]==min) { t2=1; g[c]=200; c++; } } } }/for/ printf("%d ",req[t1]); g[c]=req[t1]; c++; move+=abs(head-req[t1]); req[t1]=0; k++; head=req[t1]; if(head==max) t2=0; }/while/ break; case 2: outtextxy(270,10,"SEEK PATTERN FOR CLOOK"); max=req[0]; min=req[0]; t2=1; c=0; for(i=1;i<n;i++) { max=max>req[i]?max:req[i]; min=min<req[i]?min:req[i]; } while(k<n) { t1=0; if(!t2) head=min; for(i=0;i<n;i++) { if(req[i]&&req[i]>=head) { if(req[i]<req[t1]) t1=i; else if(req[i]==max) { head=1; g[c]=1; c++; } } }/for/ printf("%d ",req[t1]); move+=abs(head-req[t1]); head=req[t1]; g[c]=req[t1]; c++; req[t1]=0; k++; if(head==max) t2=0; }/while/ break; case 3: outtextxy(270,10,"SEEK PATTERN FOR FCFS"); for(i=0,c=0;i<n;i++,c++) { printf("%d ",req[i]); move+=abs(head-req[i]); head=req[i]; g[c]=req[i]; } break; }/switch/ printf("Order of servicing: "); printf("%d: ",h); for(i=0;i<n;i++) printf("%d ",g[i]); printf(" Total Head Movements: %d ",move); x=getmaxx(); y=getmaxy(); rectangle(0,20,x-5,y-5); a1=(x-30)/10; b=110; a=h+(3a1); y1=125; fillellipse(a,b,2,2); for(i=0;i<n;i++) { int x1=g[i]+(3a1); fillellipse(x1,y1,2,2); line(a,b,x1,y1); a=x1; b=y1; y1+=15; } getch(); clrscr(); clearviewport(); printf(" (1) LOOK (2) CLOOK (3) FCFS (0) EXIT Enter your choice: "); scanf("%d",&ch); }/while/ getch(); }/main/

Related Source Codes

Script Name Author

The Game Opposite as seen on Nokia 2300 Mobile Manikanta

RECURSIVE BALANCED QUICK SORT ashish

Radix Sort ashish

Change your mouse pointer Ashim

The blinking star Shashank

Data Validation Crylittlebaby

To search a file by giving file type like mp3 or mpeg or doc Prashanth SR

Menus Demonstration B.Chidhambaram

Employee Database Project Using C. Reenku Raman Nayak

Creating a Lexical Analyzer in c fahad bader al-buhairi �դ ?�� ??��

Calendar Program Omkar & Devendra

Stop double Process for start in C Cedrik Jurak

Stop double Process for start in C Cedrik Jurak

Time Scheduler Atiq Anwar

A timepass game between atmost two players Rahul Roy

A D V E R T I S E M E N T

Google Groups Subscribe to SourceCodesWorld - Techies Talk

Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.

Advertisements

L I N K S

Jobs & Career: Freshers Jobs; Jobs Newsletter; Placement Papers; Placement Papers
GATE Preparation: Analysis & Design Of Algo.; Operating System; Lexical Analysis
GRE Preparation: GRE Home; 1208 Antonyms Test; 5000 Word's List; Top 100 Words' List; Scholarships; Top 100 CS Univ.; Top 126 EE Univ.
Tutorials: Hardware Tutorial; 1500 Free eBooks; XML Tutorial
Webmaster Resources: EzTraffic; Articles
Fun: Send FREE SMS!; SMS Jokes; Love SMS; Funny Jokes

Google Search

Source Codes World.com is a part of Vyom Network.

Sitemap | Privacy Policy | Terms and Conditions | Important Websites
Copyright ©2003-2024 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=1206