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

Fixed links for B6 and B7 in README.

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

4
README.md
View File

@ -16,8 +16,8 @@ This repository serves as a comprehensive resource for the Systems Programming a
- [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. [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)
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-A6.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-A7.cpp)
### Notes