Consider six memory partitions of size 200 kB, 400 kB, 600 kB, 500 kB, 300 kB and 250 kB, where kB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 kB, 210 kB, 468 kB and 491 kB in that order. If the best fit algorithm is used, which partitions are not allotted to any process ?
200 kB and 300 kB
Best fit places each process in the smallest free partition that is large enough to hold it, processing requests in arrival order. With fixed partitions, a partition used once is no longer free.
Step 1 — 357 kB: partitions large enough are 400, 600 and 500 kB; the smallest is 400 kB, so it is allotted.
Step 2 — 210 kB: free partitions that fit are 600, 500, 300 and 250 kB; the smallest is 250 kB.
Step 3 — 468 kB: free partitions that fit are 600 and 500 kB; the smallest is 500 kB.
Step 4 — 491 kB: only 600 kB is large enough, so it is allotted.
The partitions left unused are 200 kB (too small for every process) and 300 kB (passed over in favour of the tighter 250 kB fit). The 250, 400 and 500 kB partitions are all used, so any pair including them is wrong.
200 kB and 300 kB option is correct.
Similar Questions
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
Important Questions from Mixed Topic (MH-SET)
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
List I List II (a) New York Public Library (i) Shelv AR (b) Miami University Augmented Research Group (ii) Smart library (c) Oula University Library (iii) Wolf Walk (d) North Carolina State University (iv) Find the future Codes:
Which part of the QR code represents the encoded data?
