Question # 3 Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4 fixed size partitions. Partition one of size 50, partition 2 of size 200, partition 3 of size 100 and partition 4 of size 150 Consider First 5 letters of your name. The ASCII code of the letters is the size of process and the alphabet is the name of process. The processes appear in alphabetical order. Q): How many processes will be loaded in the memory at a time? For contiguous memory allocation show the algorithms used to allocate memory partitions to each process and state which algorithm will work best and why? Also state the amount of internal and external fragmentation for the processes and partitions after allocation

Question # 3
Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4 fixed size partitions. Partition one of size 50, partition 2 of size 200, partition 3 of size 100 and partition 4 of size 150 Consider First 5 letters of your name. The ASCII code of the letters is the size of process and the alphabet is the name of process. The processes appear in alphabetical order.

Q): How many processes will be loaded in the memory at a time? For contiguous memory allocation show the algorithms used to allocate memory partitions to each process and state which algorithm will work best and why? Also state the amount of internal and external fragmentation for the processes and partitions after allocation