From 3e3c0978b9ff6a4d6ff55efc0c131073c2f800e3 Mon Sep 17 00:00:00 2001
From: TanmayMachkar <tanmaymacho@gmail.com>
Date: Sun, 28 Jul 2024 12:32:06 +0530
Subject: [PATCH] added fcfs code

---
 .../Assignment - 5/FCFS (Non-Preemptive).cpp  | 61 +++++++++++++++++++
 ...F (Premptive).cpp => SJF (Preemptive).cpp} |  0
 README.md                                     |  1 +
 3 files changed, 62 insertions(+)
 create mode 100644 Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp
 rename Codes/Group B/Assignment - 5/{SJF (Premptive).cpp => SJF (Preemptive).cpp} (100%)

diff --git a/Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp b/Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp
new file mode 100644
index 0000000..d4cc495
--- /dev/null
+++ b/Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp	
@@ -0,0 +1,61 @@
+#include<iostream>
+using namespace std;
+
+struct fcfs{
+    int burst, arrival, id, completion;
+};
+fcfs meh[30];
+
+class FCFS{
+public:
+    int n;
+    void fcfsIn(){
+        cout<<"\nEnter number of processes: ";
+        cin>>n;
+        for(int i = 0; i < n; i++){
+            cout<<"\nEnter arrival time of P"<<i<<": ";
+            cin>>meh[i].arrival;
+            cout<<"\nEnter burst time of P"<<i<<": ";
+            cin>>meh[i].burst;
+            meh[i].id = i;
+        }
+        cout<<"\n  | Arrival | Burst\n";
+        for(int j = 0; j < n; j++) {
+            cout<<"P"<<j<<"| "<<meh[j].arrival<<"       | "<<meh[j].burst<<"\n";
+        }
+    }
+    void process() {
+        cout<<"\nSequence of processes is: ";
+        int currentTime = 0;
+
+        for(int i = 0; i < n; i++){
+            if(currentTime < meh[i].arrival){
+                while(currentTime < meh[i].arrival){
+                    cout<<" NULL ";
+                    currentTime++;
+                }
+            }
+
+            cout<<"P"<<meh[i].id<<" ";
+            currentTime += meh[i].burst;
+            meh[i].completion = currentTime;
+        }
+    }
+
+    void completion()
+    {
+        cout<<"\n\n  | Completion time\n";
+        for(int j = 0; j < n; j++) {
+            cout<<"P"<<j<<"| "<<meh[j].completion<<"\n";
+        }
+    }
+};
+
+int main()
+{
+    FCFS obj;
+    obj.fcfsIn();
+    obj.process();
+    obj.completion();
+    return 0;
+}
diff --git a/Codes/Group B/Assignment - 5/SJF (Premptive).cpp b/Codes/Group B/Assignment - 5/SJF (Preemptive).cpp
similarity index 100%
rename from Codes/Group B/Assignment - 5/SJF (Premptive).cpp
rename to Codes/Group B/Assignment - 5/SJF (Preemptive).cpp
diff --git a/README.md b/README.md
index 3e01dc3..f6f3555 100644
--- a/README.md
+++ b/README.md
@@ -2,4 +2,5 @@
 
 ##### Group B
 5. [CPU Scheduling Algorithms: FCFS, SJF (Preemptive), Priority (Non-Preemptive) and Round Robin (Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205)
+    - [FCFS (Non-Preemptive)]()
     - [SJF (Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/SJF%20%28Premptive%29.cpp)
\ No newline at end of file