2
1

readme updated

This commit is contained in:
Tanmay 2024-10-12 22:09:37 +05:30
parent 77fef62173
commit ca8541ebce

View File

@ -14,6 +14,7 @@ This repository serves as a comprehensive resource for the Systems Programming a
- [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) - [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) - [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) 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)
### Notes ### Notes