From 33649a188a6699e0bc019a72d04ee0718ace4d81 Mon Sep 17 00:00:00 2001
From: Pallaav Sethi <pallaav.sethi@gmail.com>
Date: Fri, 15 Oct 2021 00:19:56 +0530
Subject: [PATCH 1/2]  Added a C program to convert  binary to decimal

---
 C/Binary to Decimal.c | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 C/Binary to Decimal.c

diff --git a/C/Binary to Decimal.c b/C/Binary to Decimal.c
new file mode 100644
index 0000000..fedeff5
--- /dev/null
+++ b/C/Binary to Decimal.c	
@@ -0,0 +1,16 @@
+#include<stdio.h>
+#include<math.h>
+ main()
+{
+	int i=0,n,re,num=0;
+	printf("Enter the binary number:");
+	scanf("%d",&n);
+	while(n>0)
+	{
+		re=n%10;
+		num=num+re*pow(2,i);
+		i++;
+		n=n/10;
+	}
+	printf("The decimal number =%d",num);
+}

From c1ae06bc296b54ba0b4fe9ace89be3675acd32c9 Mon Sep 17 00:00:00 2001
From: Pallaav Sethi <pallaav.sethi@gmail.com>
Date: Tue, 26 Oct 2021 23:41:48 +0530
Subject: [PATCH 2/2] Added Round Robin Algorithm

---
 C/round_robin.c | 118 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 118 insertions(+)
 create mode 100644 C/round_robin.c

diff --git a/C/round_robin.c b/C/round_robin.c
new file mode 100644
index 0000000..d2b8cc2
--- /dev/null
+++ b/C/round_robin.c
@@ -0,0 +1,118 @@
+#include<stdio.h>
+#include<stdlib.h>
+void rr(int,int,int[],int[]);
+void srtf();
+void main()
+{
+int n,tq,choice;
+int bt[10],st[10],i,j,k;
+for(;;)
+{
+printf("Enter the choice\n");
+printf("1) Round Robin\n 2) SRT \n 3) Exit\n");
+scanf("%d", &choice);
+switch(choice)
+{
+case 1: printf("Round Robin scheduling algorithm\n");
+printf("Enter the number of process\t");
+scanf("%d",&n);
+printf("Enter the burst time for sequences\n");
+for(i=0;i<n;i++)
+{
+scanf("%d",&bt[i]);
+st[i]=bt[i];
+}
+printf("Enter time quantum\n");
+scanf("%d",&tq);
+rr(n,tq,st,bt);
+break;
+case 2: printf("\n\n_______Shortest Remaining Time____\n");
+srtf();
+break;
+case 3: exit(0);
+break;
+}
+}
+}
+void rr(int n,int tq,int st[],int bt[])
+{
+int tat[10],wt[10],i,count=0,swt=0,stat=0,temp1,sq=0,j,k;
+float awt=0.0,atat=0.0;
+while(1)
+{
+for(i=0,count=0;i<n;i++)
+{
+temp1=tq;
+if(st[i]==0)
+{
+count++;
+continue;
+}
+if(st[i]>tq)
+st[i]=st[i]-tq;
+else if(st[i]>=0)
+{
+temp1=st[i];
+st[i]=0;
+}
+sq=sq+temp1;
+tat[i]=sq;
+}
+if(n==count)
+break;
+}
+for(i=0;i<n;i++)
+{
+wt[i]=tat[i]-bt[i];
+swt=swt+wt[i];
+stat=stat+tat[i];
+}
+awt=(float)swt/n;
+atat=(float)stat/n;
+printf("Process no burst time waiting time turn around time\n");
+for(i=0;i<n;i++)
+printf("%d\t\t%d\t\t%d\t\t%d\n",i+1,bt[i],wt[i],tat[i]);
+printf("Average waiting time %f avg turnaround time is %f\n",awt,atat);
+}
+void srtf()
+{
+int n,j=0,st[10],bt[10],rt[10],remain=0,smallest,time=0,i,endtime,swt=0,stat=0;
+printf("Enter the no of process");
+scanf("%d",&n);
+for(i=0;i<n;i++)
+{
+printf("Enter the arrival time for p[%d]:",i+1);
+scanf("%d",&st[i]);
+printf("Enter the burst time for p[%d]:",i+1);
+scanf("%d",&bt[i]);
+rt[i]=bt[i];
+}
+rt[100]=999;
+printf("Process\t|Writing time\t|Turn around time\n");
+for(time=0;remain!=n;time++)
+{
+smallest=100;
+for(i=0;i<n;i++)
+{
+if(st[i]<=time && rt[i]<rt[smallest] && rt[i]>0)
+{
+smallest = i;
+}
+}
+rt[smallest]--;
+if(rt[smallest]==0)
+{
+remain++;
+endtime=time+1;
+j=smallest;
+printf("p[%d]\t|\t%d\t|\t%d\n",smallest+1,endtime-bt[j]-st[j],endtime-st[j]);
+swt+=endtime-bt[j]-st[j];
+stat+=endtime-st[j];
+}
+}
+float awt=0.0, atat=0.0;
+awt=(float)swt/n;
+atat=(float)stat/n;
+printf("Avg waiting time:%f\n",awt);
+printf("Avg turnaround time:%f\n",atat);
+}
\ No newline at end of file