Update one

Author: Binayak123

one

@@ -1,115 +1,76 @@
-#include<stdio.h> 
- 
-int main() 
-{ 
-      int i, limit, total = 0, x, counter = 0, time_quantum,j; 
-      
-	  int wait_time = 0, turnaround_time = 0,pos,z,p[10],prio[10], a_time[20], b_time[10], temp[10],b; 
-      
-	  float average_wait_time, average_turnaround_time;
-      
-	  printf("\nEnter Total Number of Processes:"); 
-      
-	  scanf("%d", &limit); 
-      
-	  x = limit; 
-      for(i = 0; i < limit; i++) 
-      {
-	    p[i]=i+1;
-	   
-	    prio[i]=0;
-            printf("\nEnter total Details of Process[%d]\n", i + 1);
-            printf("Arrival Time:\t");
-            scanf("%d", &a_time[i]);
-            printf("Burst Time:\t");
-            scanf("%d", &b_time[i]); 
-            temp[i] = b_time[i];
-      }
-	   
-      printf("\nEnter the Time Quantum:"); 
-      scanf("%d", &time_quantum); 
-      printf("\nProcess ID\t\tBurst Time\t Turnaround Time\t Waiting Time\t Priority\n");
-      for(total = 0, i = 0; x != 0;) 
-      { 
-
-		    for(z=0;z<limit;z++)
-		    {
-			int temp1;
-			pos=z;
-			for(j=z+1;j<limit;j++)
-			{
-			    if(prio[j]<prio[pos])
-				pos=j;
-			}
-		 
-		temp1=prio[z];
-	
-		prio[z]=prio[pos];
-	
-		prio[pos]=temp1;
-		 
-			temp1=b_time[z];
-			b_time[z]=b_time[pos];
-			b_time[pos]=temp1;
-		 			temp1=a_time[z];
-				a_time[z]=a_time[pos];
-			a_time[pos]=temp1;
-
-			temp1=p[z];
-				p[z]=p[pos];
-			p[pos]=temp1;
+#include<stdio.h>
 
-			temp1=temp[z];
-				temp[z]=temp[pos];
-			temp[pos]=temp1;
-		    }
-		{
-		}
-            
-			if(temp[i] <= time_quantum && temp[i] > 0) 
-            { 
-                  total = total + temp[i]; 
-                  temp[i] = 0; 
-                  counter = 1; 
-            } 
-            
-			else if(temp[i] > 0) 
-            { 
-                  temp[i] = temp[i] - time_quantum; 
-                  total = total + time_quantum; 
-            } 
+struct process
+{
+      char process_name;
+      int arrival_time, burst_time, ct, waiting_time, turnaround_time, priority;
+      int status;
+}process_queue[10];
 
-	for(b=0;b<limit;b++)
-		{
-			if(b==i)
-			prio[b]+=1;
-			else
-			prio[b]+=2;
-		}
+int limit;
 
-            if(temp[i] == 0 && counter == 1) 
-            { 
-                  x--; 
-                  printf("\nProcess[%d]\t\t%d\t\t %d\t\t %d\t\t%d", p[i], b_time[i], total - a_time[i], total - a_time[i] - b_time[i],prio[i]);
-                  wait_time = wait_time + total - a_time[i] - b_time[i]; 
-                  turnaround_time = turnaround_time + total - a_time[i]; 
-                  counter = 0; 
-            } 
-            if(i == limit - 1) 
-            {
-                  i = 0; 
-            
-			}
-            else if(a_time[i + 1] <= total) 
+void Arrival_Time_Sorting()
+{
+      struct process temp;
+      int i, j;
+      for(i = 0; i < limit - 1; i++)
+      {
+            for(j = i + 1; j < limit; j++)
             {
-                  i++;
-            
-			}
-            else 
+                  if(process_queue[i].arrival_time > process_queue[j].arrival_time)
+                  {
+                        temp = process_queue[i];
+                        process_queue[i] = process_queue[j];
+                        process_queue[j] = temp;
+                  }
+            }
+      }
+}
+
+void main()
+{
+      int i, time = 0, burst_time = 0, largest;
+      char c;
+      float wait_time = 0, turnaround_time = 0, average_waiting_time, average_turnaround_time;
+      printf("\nEnter Total Number of Processes:\t");
+      scanf("%d", &limit);
+      for(i = 0, c = 'A'; i < limit; i++, c++)
+      {
+            process_queue[i].process_name = c;
+            printf("\nEnter Details For Process[%C]:\n", process_queue[i].process_name);
+            printf("Enter Arrival Time:\t");
+            scanf("%d", &process_queue[i].arrival_time );
+            printf("Enter Burst Time:\t");
+            scanf("%d", &process_queue[i].burst_time);
+            printf("Enter Priority:\t");
+            scanf("%d", &process_queue[i].priority);
+            process_queue[i].status = 0;
+            burst_time = burst_time + process_queue[i].burst_time;
+      }
+      Arrival_Time_Sorting();
+      process_queue[9].priority = -9999;
+      printf("\nProcess Name\tArrival Time\tBurst Time\tPriority\tWaiting Time");
+      for(time = process_queue[0].arrival_time; time < burst_time;)
+      {
+            largest = 9;
+            for(i = 0; i < limit; i++)
             {
-                  i = 0;
-            
-			}		
-      } 
-      return 0; 
+                  if(process_queue[i].arrival_time <= time && process_queue[i].status != 1 && process_queue[i].priority > process_queue[largest].priority)
+                  {
+                        largest = i;
+                  }
+            }
+            time = time + process_queue[largest].burst_time;
+            process_queue[largest].ct = time;
+            process_queue[largest].waiting_time = process_queue[largest].ct - process_queue[largest].arrival_time - process_queue[largest].burst_time;
+            process_queue[largest].turnaround_time = process_queue[largest].ct - process_queue[largest].arrival_time;
+            process_queue[largest].status = 1;
+            wait_time = wait_time + process_queue[largest].waiting_time;
+            turnaround_time = turnaround_time + process_queue[largest].turnaround_time;
+            printf("\n%c\t\t%d\t\t%d\t\t%d\t\t%d", process_queue[largest].process_name, process_queue[largest].arrival_time, process_queue[largest].burst_time, process_queue[largest].priority, process_queue[largest].waiting_time);
+      }
+      average_waiting_time = wait_time / limit;
+      average_turnaround_time = turnaround_time / limit;
+      printf("\n\nAverage waiting time:\t%f\n", average_waiting_time);
+      printf("Average Turnaround Time:\t%f\n", average_turnaround_time);
 }