c++ program to count total number of head movement using scan scheduling algorithm.

#include<iostream.h>
#include<fstream.h>
#include<stdio.h>
#include<conio.h>
#include<math.h>

int main()
{
int n;
cout<<"enter your queue size:";
cin>>n;
int ub,lb=0;
cout<<"Enter your upper bound:";
cin>>ub;
int queue[3];
int head;
cout<<"Enter your head:";
cin>>head;
int minindex;
int temp,len=0,i,j,lrem [5],t;
int rrem[5],prev=ub,current=0,qsize=n,lrsize=0,rrsize=0;
    for(i=0;i<n;i++)
    {

 

    cout<<"enter value for queue:";
        cin>>queue[i];
        if(queue[i] >head)
        {
            rrem[rrsize]=i;
            rrsize=rrsize+1;
        }
        else
        {
            lrem[lrsize]=i;
            lrsize=lrsize+1;
        }
    }
    //sorting of both lrem & rrem
   
    for(i=0;i<lrsize-1;i++)
    {
        for(j=i;j<lrsize;j++)
        {
            if(queue[lrem[i]] > queue[lrem[j]])
            {
                t=lrem[i];
                lrem[i]=lrem[j];
                lrem[j]=t;
            }           
        }
    }
    for(i=0;i<rrsize-1;i++)
    {
        for(j=i;j<rrsize;j++)
        {
            if(queue[rrem[i]] > queue[rrem[j]])
            {
                t=rrem[i];
                rrem[i]=rrem[j];
                rrem[j]=t;
            }           
        }
    }
   
    int vl,vr,val;
    current=head;
       
    vl=head-lb;//left side
    val=queue[rrem[0]]-lb;
    vr=queue[rrem[rrsize-1]]-queue[rrem[0]];
   
    len=val+vl+vr;
    cout<<"head movement length is: ";
    cout<<len;
    return 0;
}

Various Process Scheduling Algorithms:

• First come First served Scheduling Algorithm
• Non preemptive Shortest job first (SJF) scheduling Algorithm
• preemptive shortest job first (SJF) scheduling algorithm
• Non preemptive priority scheduling algorithm
• preemptive priority scheduling algorithm
• Roun Robin scheduling Algorithm

Various Page Replacement Algorithms:

• Page replacement using Least Recently Used (LRU) algorithm techneques.
• Page replacement using First come first served algorithm techniques.

Various Disk Head Movement Counting Algorithms:

• Count the disk head movement using first come first served (FCFS) algorithm
• head movement count using shortest seek job first (SSJF)
• head movement count using scan scheduling algorithm
• head movement count using c-scan scheduling algorithm
• head movement count using loop scheduling algorithm
• head movement count using c-loop scheduling alogrithm