From adabdf812e6c0e1a413a35a701ab0bbb9aa30aca Mon Sep 17 00:00:00 2001 From: Kshitij Date: Mon, 14 Oct 2024 11:10:55 +0530 Subject: [PATCH] Moved codes around in the Codes folder and changed names for better understanding. Added links in README file. --- .../{Assignment - 2/2 Pass Macro.py => Code-A2.py} | 0 Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp | 0 ...bin (Preemptive)..cpp => Round Robin (Preemptive).cpp} | 0 Codes/Group B/Assignment - 5/SJF (Preemptive).cpp | 0 ...t fit, first fit, next fit and worst.cpp => Code-A6.cpp} | 0 ...placement Algorithm - LRU, Optimal.cpp => Code-A7.cpp} | 0 README.md | 8 ++++---- 7 files changed, 4 insertions(+), 4 deletions(-) rename Codes/Group A/{Assignment - 2/2 Pass Macro.py => Code-A2.py} (100%) mode change 100755 => 100644 Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp rename Codes/Group B/Assignment - 5/{Round Robin (Preemptive)..cpp => Round Robin (Preemptive).cpp} (100%) mode change 100755 => 100644 Codes/Group B/Assignment - 5/SJF (Preemptive).cpp rename Codes/Group B/{Assignment - 6/Memory placement strategies – best fit, first fit, next fit and worst.cpp => Code-A6.cpp} (100%) rename Codes/Group B/{Assignment - 7/Page Replacement Algorithm - LRU, Optimal.cpp => Code-A7.cpp} (100%) diff --git a/Codes/Group A/Assignment - 2/2 Pass Macro.py b/Codes/Group A/Code-A2.py similarity index 100% rename from Codes/Group A/Assignment - 2/2 Pass Macro.py rename to Codes/Group A/Code-A2.py diff --git a/Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp b/Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp old mode 100755 new mode 100644 diff --git a/Codes/Group B/Assignment - 5/Round Robin (Preemptive)..cpp b/Codes/Group B/Assignment - 5/Round Robin (Preemptive).cpp similarity index 100% rename from Codes/Group B/Assignment - 5/Round Robin (Preemptive)..cpp rename to Codes/Group B/Assignment - 5/Round Robin (Preemptive).cpp diff --git a/Codes/Group B/Assignment - 5/SJF (Preemptive).cpp b/Codes/Group B/Assignment - 5/SJF (Preemptive).cpp old mode 100755 new mode 100644 diff --git a/Codes/Group B/Assignment - 6/Memory placement strategies – best fit, first fit, next fit and worst.cpp b/Codes/Group B/Code-A6.cpp similarity index 100% rename from Codes/Group B/Assignment - 6/Memory placement strategies – best fit, first fit, next fit and worst.cpp rename to Codes/Group B/Code-A6.cpp diff --git a/Codes/Group B/Assignment - 7/Page Replacement Algorithm - LRU, Optimal.cpp b/Codes/Group B/Code-A7.cpp similarity index 100% rename from Codes/Group B/Assignment - 7/Page Replacement Algorithm - LRU, Optimal.cpp rename to Codes/Group B/Code-A7.cpp diff --git a/README.md b/README.md index e692026..51afabb 100644 --- a/README.md +++ b/README.md @@ -8,16 +8,16 @@ This repository serves as a comprehensive resource for the Systems Programming a ### Codes ##### Group A -2. [Pass 1 and Pass 2 of 2-Pass Macroprocessor](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20A/Assignment%20-%202/2%20Pass%20Macro.py) +2. [Code-A2 - Pass 1 and Pass 2 of 2-Pass Macroprocessor](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20A/Code-A2.py) ##### 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)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/FCFS%20%28Non-Preemptive%29.cpp) - [SJF (Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/SJF%20%28Preemptive%29.cpp) - [Priorty (Non-Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/Priority%20%28Non-Preemptive%29.cpp) - - [Round Robin (Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/Round%20Robin%20%28Preemptive%29..cpp) -6. [Memory Placement Strategies – Best Fit, First Fit, Next Fit and Worst Fit](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%206/Memory%20placement%20strategies%20%E2%80%93%20best%20fit%2C%20first%20fit%2C%20next%20fit%20and%20worst.cpp) -7. [Page Replacement Algorithms - LRU(Least Recently Used), Optimal](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%207/Page%20Replacement%20Algorithm%20-%20LRU%2C%20Optimal.cpp) + - [Round Robin (Preemptive)](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Assignment%20-%205/Round%20Robin%20%28Preemptive%29.cpp) +6. [Code-B6 - Memory Placement Strategies – Best Fit, First Fit, Next Fit and Worst Fit](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Code-B6.cpp) +7. [Code-B7 - Page Replacement Algorithms - LRU(Least Recently Used), Optimal](https://git.kska.io/sppu-te-comp-content/SystemsProgrammingAndOperatingSystem/src/branch/main/Codes/Group%20B/Code-B7.cpp) ### Notes