Q$\mathrm{.}1)(3$ points$)$

State any three disadvantages associated with the Fixed$-$sized partitioning technique of memory

management.

Q$\mathrm{.}2)(3$ points$)$

This diagram given below shows an example of memory configuration under dynamic partitioning after a

number of placement and swapping$-$out operations have been carried out. Addresses go from left to right;

yellow areas indicate blocks occupied by processes; white areas indicate free memory blocks. The last

process placed is marked with an X$.$

$($Please Note : All your answers have to be strictly with reference to the above diagram$)$

$5$M $3$M $4$M $6$M X $2$M $4$M $3$M

A new $2-$MB allocation request must be satisfied next. Indicate the intervals of memory where a partition

will be created for the new process under the $3$ placement algorithms $$ Best fit, first fit and next fit.

$($Kindly note: You will have to re$-$draw the entire memory strip showing the respective changes.$)$

Q$\mathrm{.}3)$

A $2-$Mbyte block of memory is allocated using the buddy system.

A$)(6$ points$)$

Show the results of the following sequence by dividing the memory into appropriate blocks.

$$ A$-$Requests $156-$KB;

$$ B$-$Requests $448-$KB;

$$ C$-$Requests $511-$KB;

$$ Release B;

$$ D$-$Requests $259-$KB;

$$ E$-$Requests $97-$KB;

$$ F$-$Requests $75-$KB;

$$ Release C;

$$ Release F;

$$ Release A;

$$ Release D;

Q$\mathrm{.}1)$

State any three disadvantages associated with the Fixed$-$sized partitioning technique of memory management.

Q$\mathrm{.}2)$

This diagram given below shows an example of memory configuration under dynamic partitioning after a number of placement and swapping$-$out operations have been carried out. Addresses go from left to right; yellow areas indicate blocks occupied by processes; white areas indicate free memory blocks. The last process placed is marked with an X $.$

$($Please Note : All your answers have to be strictly with reference to the a File Preview am$)$

A new $2-$MB allocation request must be satisfied next. Indicate the intervals of memory where a partition will be created for the new process under the $3$ placement algorithms $-$ Best fit, first fit and next fit.

$($Kindly note: You will have to re$-$draw the entire memory strip showing the respective changes.$)$

Q$\mathrm{.}3)$

A $2-$Mbyte block of memory is allocated using the buddy system.

A$)$

Show the results of the following sequence by dividing the memory into appropriate blocks.

A$-$Requests $156-$KB;

$-$ B$-$Requests $448-$KB;

$-$ C$-$Requests $511-$KB;

$-$ Release B;

D$-$Requests $259-$KB;

OPERATING SYSTEMS

$-$ Release E$.$

B$)$

Show the binary tree representation following 'Release C$\text{'}.$ Also show the correspondence of the leaf nodes to the appropriate partitions within the memory strip.

Q$\mathrm{.}4)$

Consider a simple paging system with the following parameters:

$-$ Size of the program $\backslash (=256\backslash )$ bytes

$-$ Page size of $16$ bytes

$-2-$Byte addressable memory

$-$ Main memory is divided into $32$ frames

Page table for the program is as follows:

Convert the following logical addresses into physical addresses using the mathematical procedure. You are expected to show each and every step of your solution:

A$)49$

B$)22$