My youtube  videos links:-

devdas

ROUND ROBIN


#include<stdio.h>
#include<conio.h>
int main()
{    int i,j,n,time,remain,flag=0,ts;
     int sum_wait=0,sum_turnaround=0,at[10],bt[10],rt[10];
     printf("Enter no of Processes : ");
     scanf("%d",&n);
     remain=n;  
     for(i=0;i<n;i++)
    {     printf("Enter  arrival time and burst time for Process P%d :",i+1);
                scanf("%d",&at[i]);  
          scanf("%d",&bt[i]);    
          rt[i]=bt[i];         }
   printf("Enter time slice");  
   scanf("%d",&ts);  
   printf("\n\nProcess\t|Turnaround time|waiting time\n\n");
                             for(time=0,i=0;remain!=0;)  
       {     if(rt[i]<=ts && rt[i]>0)    
                       {       time+=rt[i];
         rt[i]=0;
        flag=1;     }    
               else if(rt[i]>0)    
                      {       rt[i]-=ts;
        time+=ts;     }    
                if(rt[i]==0 && flag==1)    
                      {       remain--;      
              printf("P[%d]\t|\t%d\t|\t%d\n",i+1,time-at[i],time-at[i]-bt[i]);  
                   sum_wait+=time-at[i]-bt[i];      
              sum_turnaround+=time-at[i];      
              flag=0;     }  
               if(i==n-1)      
               i=0;  
             else if(at[i+1]<=time)    
             i++;  
             else
       i=0;             }
 printf("\nAvg sum_wait = %f\n",sum_wait*1.0/n);  
printf("Avg sum_turnaround = %f",sum_turnaround*1.0/n);  
return 0; }

SJF;;


#include<stdio.h>

void main()
{
    int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,pos,temp;
    float avg_wt,avg_tat;
    printf("Enter number of process:");
    scanf("%d",&n);

    printf("nEnter Burst Time:n");
    for(i=0;i<n;i++)
    {
        printf("p%d:",i+1);
        scanf("%d",&bt[i]);
        p[i]=i+1;           //contains process number
    }

    //sorting burst time in ascending order using selection sort
    for(i=0;i<n;i++)
    {
        pos=i;
        for(j=i+1;j<n;j++)
        {
            if(bt[j]<bt[pos])
                pos=j;
        }

        temp=bt[i];
        bt[i]=bt[pos];
        bt[pos]=temp;

        temp=p[i];
        p[i]=p[pos];
        p[pos]=temp;
    }

    wt[0]=0;            //waiting time for first process will be zero

    //calculate waiting time
    for(i=1;i<n;i++)
    {
        wt[i]=0;
        for(j=0;j<i;j++)
            wt[i]+=bt[j];

        total+=wt[i];
    }

    avg_wt=(float)total/n;      //average waiting time
    total=0;

    printf("nProcesst    Burst Time    tWaiting TimetTurnaround Time");
    for(i=0;i<n;i++)
    {
        tat[i]=bt[i]+wt[i];     //calculate turnaround time
        total+=tat[i];
        printf("np%dtt  %dtt    %dttt%d",p[i],bt[i],wt[i],tat[i]);
    }

    avg_tat=(float)total/n;     //average turnaround time
    printf("nnAverage Waiting Time=%f",avg_wt);
    printf("nAverage Turnaround Time=%fn",avg_tat);

}

FCFS

#include<stdio.h>
//#include<conio.h>
#include<process.h>
int main()
{
char p[10][5];
int tot=0,wt[10],i,n,pt[10],et[10];
float avg=0;
//clrscr();
printf("enter no of processes:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("enter process%d name:\n",i+1);
scanf("%s",&p[i]);
printf("enter process time");
scanf("%d",&pt[i]);
}

wt[0]=0;
for(i=1;i<n;i++)
{
wt[i]=wt[i-1]+et[i-1];
tot=tot+wt[i];
}
avg=(float)tot/n;
printf("p_name\t P_time\t w_time\n");
for(i=0;i<n;i++)
printf("%s\t%d\t%d\n",p[i],et[i],wt[i]);
printf("total waiting time=%d\n avg waiting time=%f",tot,avg);
getch();
return 0;
}

First 8K TV screen to be put on sale by Sharp in October

Interested? You'd better be prepared to pay up. The 85-inch "LV-85001" ultra-high definition TV set will cost you ¥16 million ($133,000) when it goes on sale October 30.

for more CLICK HERE!