Register

Recent questions tagged process-scheduling

1 votes
1 answer
93
NIELIT 2017 July Scientist B (IT) - Section B: 47
Which of the following process scheduling algorithm may lead to starvation? FIFO Round Robin Shortest Job Next None of the option
Which of the following process scheduling algorithm may lead to starvation?FIFORound RobinShortest Job NextNone of the option
User Avatar
0 votes
4 answers
95
NIELIT 2017 DEC Scientist B - Section B: 12
Consider the following four processes with their corresponding arrival time and burst time: ... turn around time (in ms) for these processes using FCFS scheduling algorithm? $15$ $12.8$ $13$ none of the options
Consider the following four processes with their corresponding arrival time and burst time:$$\begin{array} \text{Process}&\text{Arrival time}&\text{Burst time(in ms)}\\ \...
User Avatar
0 votes
2 answers
96
UGC NET CSE | December 2006 | Part 2 | Question: 37
____________ is one of pre-emptive scheduling algorithm. Shortest-Job-first Round-robin Priority based Shortest-Job-next
____________ is one of pre-emptive scheduling algorithm.Shortest-Job-firstRound-robinPriority basedShortest-Job-next
User Avatar
2 votes
1 answer
104
ISRO2020-27
Which of the following algorithms defines time quantum? shortest job scheduling algorithm round robin scheduling algorithm priority scheduling algorithm multilevel queue scheduling algorithm
Which of the following algorithms defines time quantum?shortest job scheduling algorithmround robin scheduling algorithmpriority scheduling algorithmmultilevel queue sche...
User Avatar
1 votes
1 answer
112
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 46 (Page No. 178)
A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?
A process running on $CTSS$ needs $30$ quanta to complete. How many times must it be swapped in, including the very first time (before it has run at all)?
User Avatar
0 votes
1 answer
114
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 44 (Page No. 177)
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer will depend on $X.)$
Five jobs are waiting to be run. Their expected run times are $9, 6, 3, 5,$ and $X$. In what order should they be run to minimize average response time? $($Your answer wi...
User Avatar
0 votes
0 answers
119
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 24 (Page No. 175)
Does Peterson’s solution to the mutual-exclusion problem shown in Fig. $2-24$ work when process scheduling is preemptive? How about when it is nonpreemptive?
Does Peterson’s solution to the mutual-exclusion problem shown in Fig. $2-24$ work when process scheduling is preemptive? How about when it is nonpreemptive?
User Avatar
Page: