From 0a23861ab85089ad2434992e8551fd5e78dc73b5 Mon Sep 17 00:00:00 2001 From: Kshitij Date: Mon, 14 Oct 2024 11:12:09 +0530 Subject: [PATCH] Fixed links for B6 and B7 in README. --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 51afabb..93403f2 100644 --- a/README.md +++ b/README.md @@ -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