0 — Test 361
Page 1 of 3
Question 1
The strategy of making processes that are logically runnable to be temporarily suspended is called ____________
0
System Administrator 2026
Question 2
What is Scheduling?
0
System Administrator 2026
Question 3
There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round-Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
0
System Administrator 2026
Question 4
Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
0
System Administrator 2026
Question 5
Which of the following algorithms tends to minimize the process flow time?
0
System Administrator 2026
Question 6
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
0
System Administrator 2026
Question 7
Which of the following statements are true? (GATE 2010) I. Shortest remaining time first scheduling may cause starvation II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time
0
System Administrator 2026
Question 8
Concurrent access to shared data may result in ____________
0
System Administrator 2026
Question 9
A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________
0
System Administrator 2026
Question 10
The segment of code in which the process may change common variables, update tables, write into files is known as ____________
0
System Administrator 2026