GATE 2022: Operating System Quiz-8 for GATE & PSU CS Exams

Question 1

The overlay tree for a program is as shown

What will be the size(in KB) of the partition (in physical memory) required to load (and run) this program?

Question 2

Given memory partition of 100K, 500K, 200K, 300K and 600K in order, if we have processes needing memory of 212K, 417K, 112K and 405K respectively, which of the following memory allocation technique(s) will be suitable to allocate memory for all the processes?
1) First fit
2) Best fit
3) Worst fit

Question 3

Given ﬁve memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), each of the ﬁrst-ﬁt, best-ﬁt, and worst-ﬁt algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)?Which algorithm makes the most efﬁcient use of memory?

Question 4

Consider the following statements:

S₁ : Using larger block size in fixed partition scheme may increase internal fragmentation.

S₂ : Variable partition and segmentation suffers from external fragmentation.

Which of the following is true?

Question 5

Given memory partition of 100K, 500K, 200K, 300K and 600K in order, if we have processes needing memory of 212K, 417K, 112K and 405K respectively, which of the following memory allocation technique(s) will be suitable to allocate memory for all the processes?
I. First Fit
II. Best Fit
III. Worst Fit

Question 6

Consider 6 memory partitions each of sizes 250 KB, 450 KB, 750 KB, 350 KB, 400 KB, 650 KB where KB refers to kilobyte. These partitions need to be allocated to four processes of size 200 KB, 460 KB, 25 KB, 700 KB in that order.

Consider the following statements with respect to the above scenario
S₁ : If first fit policy is used, no process will remain unallocated.
S₂ : If best fit policy is used, no process will remain unallocated.
What of the above statements is correct?