sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
sppu-te-comp-content/SystemsProgrammingAndOperatingSystem
3
1
Fork 0
Code Issues Activity

Moved codes around in the Codes folder and changed names for better understanding. Added links in README file.

Browse Source
This commit is contained in:
K 2024-10-14 11:10:55 +05:30
parent c98fd2fd76
commit adabdf812e
Signed by: notkshitij
GPG Key ID: C5B8BC7530F8F43F
7 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

0
Codes/Group A/Assignment - 2/2 Pass Macro.py → Codes/Group A/Code-A2.py
View File

0
Codes/Group B/Assignment - 5/FCFS (Non-Preemptive).cpp Executable file → Normal file
View File

0
Codes/Group B/Assignment - 5/Round Robin (Preemptive)..cpp → Codes/Group B/Assignment - 5/Round Robin (Preemptive).cpp
View File

0
Codes/Group B/Assignment - 5/SJF (Preemptive).cpp Executable file → Normal file
View File

0
Codes/Group B/Assignment - 6/Memory placement strategies – best fit, first fit, next fit and worst.cpp → Codes/Group B/Code-A6.cpp
View File

0
Codes/Group B/Assignment - 7/Page Replacement Algorithm - LRU, Optimal.cpp → Codes/Group B/Code-A7.cpp
View File

8
README.md
View File

@ -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