Which CPU scheduling algorithm assigns a fixed time slice (quantum) sequentially to each runnable process in the ready queue?
Answer and explanation
Correct answer: A. Round Robin scheduling
- Step 1: Round Robin is a preemptive scheduling algorithm designed for time-sharing operating systems. Step 2. When a process's quantum expires, the scheduler context-switches it to the back of the queue, preventing resource starvation. Answer: Round Robin scheduling. Why not the others: FCFS is non-preemptive arrival order; SJN schedules shortest execution bursts first; priority scheduling executes highest priority tasks first.
Practise more Computer Systems, Networking and ICT.
Free questions with an explanation for every one, and full timed Bangladesh Civil Service Preliminary Examination mock tests.
More Computer Systems, Networking and ICT questions
- Which internal CPU register holds the memory address of the next machine instruction to be fetched and executed by the processor?
- Which type of computer memory provides the fastest read and write access times directly to the arithmetic logic unit?
- How many distinct memory addresses can be uniquely referenced by a microprocessor with a 32-bit address bus?
- What is the hexadecimal equivalent of the 8-bit binary number 11011010_2?
- Which logic gate outputs a binary 1 if and only if its two binary inputs are unequal (one is 1 and the other is 0)?
- Which two digital logic gates are considered universal gates because any combinational circuit can be constructed solely using either of theā¦