Multiple Choice
What is FIFO algorithm?
A) first executes the job that came in last in the queue
B) first executes the job that came in first in the queue
C) first executes the job that needs minimal processor
D) first executes the job that has maximum processor needs
Correct Answer:
Verified
Correct Answer:
Verified
Q1: A process is selected from the_ queue
Q2: What is Waiting time?<br>A)the total time in
Q3: What is Dispatch latency?<br>A)the speed of dispatching
Q4: The switching of the CPU from one
Q5: Under multiprogramming, turnaround time for short jobs
Q7: The strategy of making processes that are
Q8: The real difficulty with SJF in short
Q9: What is Response time?<br>A)the total time taken
Q10: Round robin scheduling falls under the category
Q11: Which is the most optimal scheduling algorithm?<br>A)fcfs