Report Bug
Qus :

Arrange the following scheduling algorithms from lowest to highest priority in terms of process execution speed:

1️⃣ First-Come, First-Served (FCFS)

2️⃣ Round Robin

3️⃣ Shortest Job First (SJF)

4️⃣ Priority Scheduling


Qusप्रक्रिया निष्पादन गति के संदर्भ में निम्नलिखित शेड्यूलिंग एल्गोरिदम को निम्नतम से उच्चतम प्राथमिकता तक व्यवस्थित करें:

A. 1 → 2 → 3 → 4
B. 2 → 1 → 4 → 3
C. 4 → 3 → 1 → 2
D. 3 → 2 → 1 → 4


Solution
A. 1 → 2 → 3 → 4



Explanation
<p>First-Come, First-Served (FCFS) has the lowest priority, as it processes tasks in the order they arrive.</p><p>Round Robin allocates equal time slices for each process.</p><p>Shortest Job First (SJF) prioritizes tasks with the shortest runtime.</p><p>Priority Scheduling assigns priority to tasks, with higher priority tasks executed first, leading to the fastest execution.</p>



Report Bug