From fdfdcbe165ae3fa0b821000c8731583d9f4d8a86 Mon Sep 17 00:00:00 2001
From: ananya-research <ananya.303.singh@gmail.com>
Date: Tue, 29 Oct 2024 09:20:28 -0700
Subject: [PATCH] Add files via upload

---
 Projects/rbb.c | 139 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 139 insertions(+)
 create mode 100644 Projects/rbb.c

diff --git a/Projects/rbb.c b/Projects/rbb.c
new file mode 100644
index 0000000..0f011d6
--- /dev/null
+++ b/Projects/rbb.c
@@ -0,0 +1,139 @@
+//ANANYA SINGH- 1928151
+
+#include<stdio.h>
+struct process
+{
+int pname;
+int at,bt,wt,tt,rt;
+int completed;
+}p[15];
+
+	int n;
+	int q[15];
+	int front=-1,rear=-1;
+	void enqueue(int i)
+{
+if(rear==15)
+	printf("overflow");
+	rear++;
+	q[rear]=i;
+	if(front==-1)
+	front=0;
+}
+
+int dequeue()
+{
+	if(front==-1)
+	printf("underflow");
+	int temp=q[front];
+	if(front==rear)
+	front=rear=-1;
+	else
+	front++;
+	return temp;
+}
+int isInQueue(int i)
+{
+	int k;
+	for(k=front;k<=rear;k++)
+	{
+		if(q[k]==i)
+		return 1;
+	}
+	return 0;
+
+}
+void sortByArrival()
+{
+	struct process temp;
+	int i,j;
+	for(i=0;i<n-1;i++)
+	for(j=i+1;j<n;j++)
+	{
+if(p[i].at>p[j].at)
+		{
+			temp=p[i];
+			p[i]=p[j];
+			p[j]=temp;
+		}
+	}
+}
+
+void main()
+{
+	int i,j,time=0,sum_bt=0,tq;
+	int c;
+	float avgwt=0;
+	float avgtt=0;
+	printf("Enter no of processes:");
+	scanf("%d",&n);
+for(i=0,c=1;i<n;i++,c++)
+{
+	p[i].pname=c;
+	printf("\nEnter the arrival time and burst time of process p%d: ",p[i].pname);
+	scanf("%d%d",&p[i].at,&p[i].bt);
+	p[i].rt=p[i].bt;
+	p[i].completed=0;
+	sum_bt+=p[i].bt;
+
+}
+
+printf("\nEnter the time quantum:");
+scanf("%d",&tq);
+printf("\n");
+
+sortByArrival();
+	enqueue(0); // enqueue the first process
+	printf("Process execution order: ");
+	
+for(time=p[0].at;time<sum_bt;) // run until the total burst time reached
+{ 
+	i=dequeue();
+
+if(p[i].rt<=tq)
+{ /* for processes having remaining time with less than or equal to time quantum */
+
+	time+=p[i].rt;
+	p[i].rt=0;
+	p[i].completed=1;
+printf(" |p%d| ",p[i].pname);
+	p[i].wt=time-p[i].at-p[i].bt;
+	p[i].tt=time-p[i].at;
+for(j=0;j<n;j++) /*enqueue the processes which have come while scheduling */
+	{
+	if(p[j].at<=time && p[j].completed!=1&& isInQueue(j)!=1)
+		{
+			enqueue(j);
+
+		}
+	}
+}
+else // more than time quantum
+{
+	time+=tq;
+	p[i].rt-=tq;
+	printf(" |P%d| ",p[i].pname);
+
+for(j=0;j<n;j++) /*first enqueue the processes which have come while scheduling */
+{
+	if(p[j].at<=time && p[j].completed!=1&&i!=j&& isInQueue(j)!=1)
+{
+enqueue(j);
+
+}
+}
+enqueue(i); // then enqueue the uncompleted process
+}
+}
+printf("\n");
+printf("\nPName\tArrival Time\tBurst Time\tWaiting Time\tTurnAround Time\t");
+for(i=0;i<n;i++)
+{
+	avgwt+=p[i].wt;
+	avgtt+=p[i].tt;
+	printf("\np%d\t\t%d\t\t%d\t\t%d\t\t%d\t\t",p[i].pname,p[i].at,p[i].bt,p[i].wt,p[i].tt);
+}
+printf("\n");
+printf("\nAverage waiting time:%.4f\n",avgwt/n);
+printf("\nAverage turnaround time:%.4f",avgtt/n);
+}
\ No newline at end of file