Register

Recent questions tagged process-scheduling

2 2 votes
0 0 answers
1.2k
1.2k views
Process scheduling
Consider the following :ProcessArrival TimeBurst Time A 0.000 3 B 1.001 6 C 4.001 4 D 6.001 2Which of the followin...
User Avatar
0 0 votes
1 1 answer
1.0k
1.0k views
#self doubt
In round-robin if one process finishes its time quantum and at the same time another process enters the system so which one will enter the ready queue first?
User Avatar
1 1 vote
0 0 answers
756
756 views
#Self Doubt OS CPU scheduling?
Does non preemptive CPU scheduling needs hardware support.kindly explain.
User Avatar
0 0 votes
1 1 answer
522
522 views
NIELIT 2021 Dec Scientist A - Section B: 120
Which one of the following cannot be scheduled by the kernel ?Kernel level threadUser level threadProcessNone of the option
User Avatar
2 2 votes
1 answers 1 answer
3.1k
3.1k views
Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O ...
User Avatar
1 1 vote
0 0 answers
579
579 views
Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O ...
User Avatar
0 0 votes
1 1 answer
721
721 views
NIELIT 2021 Dec Scientist B - Section B: 57
____________ is the elapsed time between the time a program or job is submitted and the time when it is completed.Response time Turnaround timeWaiting timeThroughput
User Avatar
2 2 votes
1 answers 1 answer
7.4k
7.4k views
Applied Grand Test 2
Three processes P1, P2 and P3 arrive at time zero. The total time spent by the process in the system is 10ms, 20ms, and 30ms respectively. They spent the first 20% of the...
User Avatar
1 1 vote
1 1 answer
2.0k
2.0k views
self doubt - FCFS - OS
Does FCFS suffer from starvation?
User Avatar
1 1 vote
1 1 answer
2.2k
2.2k views
#self doubt #round robin #cpu scheduling
in round robin algorithm if a process with burst time = 10 arrived at t=0 and time quantum is 2 units, context switch time is 2 units . Then completion time of the proces...
User Avatar
0 0 votes
1 1 answer
994
994 views
UGC NET CSE | December 2019 | Part 2 | Question: 26
Which of the following $\text{CPU}$ scheduling algorithms is/are supported by $\text{LINUX}$ operating system?Non-preemptive priority schedulingPreemptive priority schedu...
User Avatar
0 0 votes
2 2 answers
1.7k
1.7k views
UGC NET CSE | December 2019 | Part 2 | Question: 28
Suppose a system has $12$ magnetic tape drives and at time $t_0$, three processes are allotted tape drives out of their need as given below:$$\begin{array}{ccc} & \text{M...
User Avatar
0 0 votes
1 1 answer
666
666 views
UGC NET CSE | December 2019 | Part 2 | Question: 30
Given $\text{CPU}$ time slice of $2\text{ms}$ and following list of processes.$$\begin{array}{ccc} \text{Process} & \text{Burst time} & \text{Arrival time} \\ & \text{(ms...
User Avatar
1 1 vote
1 1 answer
2.7k
2.7k views
UGC NET CSE | December 2019 | Part 2 | Question: 74
Identify the circumstances under which pre-emptive $\text{CPU}$ scheduling is used:A process switches from Running state to Ready stateA process switches from Waiting sta...
User Avatar
53 53 votes
3 answers 3 answers
23.5k
23.5k views
GATE CSE 2021 | Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...
User Avatar
32 32 votes
7 answers 7 answers
19.8k
19.8k views
GATE CSE 2021 | Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
User Avatar
1 1 vote
1 1 answer
519
519 views
NIELIT Scientist B 2020 November: 72
One disk queue with requests for $I/O$ to blocks on cylinders. The Request are in the following manner:$\text{98 183 37 122 14 124 65 67}$Considering $SSTF$ (shortest see...
User Avatar
4 4 votes
4 4 answers
2.0k
2.0k views
NIELIT 2016 MAR Scientist C - Section C: 7
In real-time operating systems, which of the following is the most suitable scheduling scheme?round-robinfirst-come-first-servedpreemptiverandom scheduling
User Avatar
3 3 votes
2 2 answers
4.1k
4.1k views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 9
Which of the following scheduling algorithms could result in starvation?PriorityRound RobinFCFSNone of the above
User Avatar
Page: