every process in a computer system requires some amount of time for its execution. This time is
both the CPU time and the I/O time
both the CPU time and the I/O time
Anonymous Quiz
12%
Turnaround time
8%
Arrival time
68%
Burst time
6%
Response time
6%
Waiting time
ملخص على المنهج كله
https://hissing-brand-42b.notion.site/Operating-Systems-95b6d0863905433f8c5ab5b31a4fb1e8
اسئلة على المنهج كله
https://drive.google.com/drive/folders/1_2shwpX2cLPe9sy1XXas1NSuYx65ZqE9
https://hissing-brand-42b.notion.site/Operating-Systems-95b6d0863905433f8c5ab5b31a4fb1e8
اسئلة على المنهج كله
https://drive.google.com/drive/folders/1_2shwpX2cLPe9sy1XXas1NSuYx65ZqE9
is used to break a tie if the next CPU bursts of two processes are the same
Anonymous Quiz
76%
FCFS
24%
SJF
SJF is optimal — gives minimum average waiting time for a given set of processes
Anonymous Quiz
81%
T
19%
F
Can be done by using the length of previous CPU bursts, using exponential averaging
Anonymous Quiz
76%
T
24%
F
Derived Channel pinned «ملخص على المنهج كله https://hissing-brand-42b.notion.site/Operating-Systems-95b6d0863905433f8c5ab5b31a4fb1e8 اسئلة على المنهج كله https://drive.google.com/drive/folders/1_2shwpX2cLPe9sy1XXas1NSuYx65ZqE9»
priority scheduling is
Anonymous Quiz
23%
preemptive
10%
nonpreemptive
64%
can be any of them
3%
None of them
the problem of priority scheduling is Starvation as low priority processes may never execute
Anonymous Quiz
83%
T
17%
F
The performance of the RR depends heavily on the size of q (time quantum)
Anonymous Quiz
89%
T
11%
F
system consists of a finite number of resources to be distributed among a number of competing
processes
processes
Anonymous Quiz
84%
T
16%
F