# UGCNET-Dec2014-II: 36

1 vote
378 views

Consider the following justifications for commonly using the two-level $CPU$ scheduling:

I. It is used when memory is too small to hold all the ready processes.

II. Because its performance is same as that of the $FIFO$.

III. Because it facilitates putting some set of processes into memory and a choice is made from that.

IV. Because it does not allow to adjust the set of in-core processes.

Which of the following is true ?

1. $I, III$ and $IV$
2. $I$ and $II$
3. $III$ and $IV$
4. $I$ and $III$

retagged

## 1 Answer

1 vote

Answer : D

Two-level scheduling uses two different schedulers, one lower-level scheduler which can only select among those processes in memory to run. That scheduler could be a Round-robin scheduler. The other scheduler is the higher-level scheduler whose only concern is to swap in and swap out processes from memory.

Reference :

Answer:

## Related questions

2 votes
1 answer
1
2.5k views
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is $8$ m.sec. if an empty frame is available or if the replaced page is not modified, and it takes $20$ m.secs., if the replaced page is modified. What is the average access time to service ... to be replaced is modified $70$% of the time ? $11.6$ m.sec. $16.4$ m.sec. $28$ m.sec. $14$ m.sec.
4 votes
1 answer
2
2.5k views
For the implementation of a paging scheme, suppose the average process size be $x$ bytes, the page size be $y$ bytes, and each page entry requires $z$ bytes. The optimum page size that minimizes the total overhead due to the page table and the internal fragmentation loss is given by $\frac{x}{2}$ $\frac{xz}{2}$ $\sqrt{2xz}$ $\frac{\sqrt{xz}}{2}$
1 vote
1 answer
3
1.1k views
Which of the following conditions does not hold good for a solution to a critical section problem ? No assumptions may be made about speeds or the number of $CPU$'s. No two processes may be simultaneously inside their critical sections. Processes running outside its critical section may block other processes. Processes do not wait forever to enter its critical section.
2 votes
1 answer
4
649 views
A specific editor has $200 K$ of program text, $15 K$ of initial stack, $50 K$ of initialized data, and $70 K$ of bootstrap code. If five editors are started simultaneously, how much physical memory is needed if shared text is used? $1135 K$ $335 K$ $1065 K$ $320 K$