1

Branch : CSE & IT Batch : Hinglish

Operating Systems
Memory Management DPP 04

[MSQ] [MCQ]
1. Problem of external fragmentation can be resolved by 6. Consider the following graphical representation of
________. program here horizontally connected blocks are
(a) Compaction independent modules and blocks connected vertically
(b) Overlay are dependent modules.
(c) Paging
(d) Non-contiguous allocation

[NAT]
2. Consider a memory system having six partitions 400
K, 200 K, 300 K, 250 K, 100 K and 500 K. There are
four process of size 289 K, 458 K, 200 K, 300 K.
What is the total size of unallocated partitions using Memory requirement of each block is as follows:
best fit allocation policy (in K)? A : 10KB E: 5KB
B : 5KB F: 10KB
[MCQ] C : 3KB G: 3KB
3. Compaction is possible with address binding. D: 2KB H: 4KB
(a) Static address binding I : 6KB
(b) Dynamic address binding Which of the following memory space is sufficient
(c) Load time address binding enough to execute the given program using overlays?
(d) Compile time address binding
(a) 48 KB (b) 25KB
(c) 50KB (d) 24KB
[MCQ]
4. Given five memory partitions of 200 K, 600 K, 300 K,
[MCQ]
400 K, 700 K, (in order), how would the first-fit, best-
7. A computer has 1000K of main memory. The jobs
fit and worst-fit algorithms place process of 312 K, 517
arrive and finish the following sequence.
K, 212 K, and 526 K, (in order)? Which algorithm
makes the most efficient use of memory? Job1 needs 100 K arrives
Note: Space left after filling a partition is not used by Job2 needs 250 K arrives
any process. Job3 needs 400 K arrives
(a) First fit Job1 finishes
(b) Best fit Job4 needs 40 K arrives
(c) Worst fit Job5 needs 250 K arrives
(d) All perform almost same. Job6 needs 60 K arrives
Which of the following allocation policy perform
[NAT] efficiently?
5. Consider a memory system with five partitions: 200 (a) First fit
K, 250 K, 500 K, 600 K and 300 K (in order). There (b) Next fit
are some process request of size 200 K, 350 K, 30 K, (c) Both will perform same
25 K, 100 K (in order). How much memory space will (d) None of these
remain unused because of internal fragmentation if
first-fit allocation policy is used?
 2

Answer Key
1. (a, c, d) 5. (1145K)
2. (350K) 6. (c)
3. (b) 7. (a)
4. (b)
 3

Hints & Solutions

1. (a, c, d) 5. (1145 K)
Compaction and non- contiguous allocation of memory Using first fit:
are two solution for external fragmentation.
Compaction is merging of non- contiguous free holes,
by relocating all process to one end.
Paging is non- contiguous allocation technique used to
solve problem of external fragmentation. Total internal fragmentation = [(200 – 200) + (250 –
30) + (500 – 350) + (600 –25) + (300 – 100)]
2. (350 K) = [0 + 220 + 150 + 575 + 200]
Using Best fit allocation policy. = 1145

6. (c)
Total space required: 10 + 5 + 3 + 2 + 5 + 10 + 3 + 4
+6
So, 250+ 100 = 350K. = 48 KB
Path I  A → B → E  20 KB
3. (b) Path II  A → B → F  25 KB
Compaction is possible with only Dynamic/run time Path III  A → C → G  16 KB
address binding.
Path IV  A → D → H  16 KB
Path V  A → D → I  18 KB
4. (b)
So, 25 KB will be sufficient enough to execute this
Using first fit:
program.
312K is placed in 600K partition.
517K is placed in 700K partition.
7. (a)
212K is placed in 300K partition.
Sequence: Job1, Job2, Job3
526K must wait.
Using Best fit:
312K is placed in 400K partition.
Job 1 finishes
517K is placed in 600K partition.
First fit:
212K is placed in 300K partition.
526K is placed in 700K partition.
Using Worst fit:
312K is placed in 700K partition. Next fit:
517K is placed in 600K partition.
212K is placed in 400K partition.
526K must wait. Job 5 will wait.
Therefore, best fit makes efficient use of memory
option ‘b’ is correct.

Any issue with DPP, please report by clicking here:- https://forms.gle/t2SzQVvQcs638c4r5

For more questions, kindly visit the library section: Link for web: https://smart.link/sdfez8ejd80if

PW Mobile APP: https://smart.link/7wwosivoicgd4