If we are told that our program uses Absolute Addressing, then select all of the following that we know must be true.

Group of answer choices

The program's addresses were produced at compile time.

In order to be dynamically relocated in RAM the program must be recompiled.

The program is broken up into segments.

The program is broken up into pages.

The program was produced using Java.

In simple Execution$-$time address binding, the CPU produces a logical address which is mapped to some physical address in RAM by adding the contents of the $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$ to the logical address.

Group of answer choices

limit register

relocation register

program counter

reverse inverter register

instruction register

Suppose that our system allocated available blocks of RAM $($holes$)$ in the following manner. If we find a block that is $<=100$ bytes larger than the program needs then we allocate that entire block to the program. So$,$ for example if a new program requires $4772$ bytes of storage and we find a block that is $4799$ bytes then we allocate the entire $4799$ bytes $($since it is only $27$ bytes larger than the needed space$).$

$$ This approach results in the following issue:$\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

Group of answer choices

Internal Fragmentation

Fluctuation.

External Fragmentation

Compaction.

When our system has enough total free space in RAM to meet the needs$/$request of a process BUT the space is broken up into multiple non$-$contiguous blocks of memory none of which is large enough to hold the entire contiguous program, then our system is suffering from $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

Group of answer choices

Internal Fragmentation

Thrashing

External Fragmentation

Regurgitation

Compaction

Which of the following are essential differences between paging and segmentation?

Group of answer choices

Paging systems store the entire program contiguously and segmentation systems do not.

Segmentation suffers from external fragmentation but paging suffers from internal fragmentation.

Segmentation systems suffer from internal fragmentation and paging systems suffer from external fragmentation.

Paging breaks a program into equal sized "chunks" called pages and segmentation breaks programs into logical units of varying size called segments.

Pages are all the same size but segments can vary in size.

Paging systems must use compile$-$time address binding but segmentation uses load$-$time address binding.

If we were to implement a Paging system for managing RAM which had frames of size $4$K $(212)$ bytes each and our addresses consisted of $32$ bits each. What is the maximum number of pages a program could have?$$

Group of answer choices

$216$

$28$

$220$

$212$

$232$

If our paging system uses pages$/$frames of size $2$N bytes and our program consists of X pages total. How much, on average, fragmentation will our program have?

Group of answer choices

$1/2*$ X

$2$N$-1$ bytes

$2$N$-$X

x $*2$N

$2$N$/2$

$1/2*$ X $*$ N

In most systems, the portions of a program's memory image that contain code$/$instructions should never be written to $($only data portions should ever have their contents changed during execution$).$ Segmentation systems are better equipped to handle read$-$only protection for a program's code portions than paging systems.$$ Briefly but clearly explain why this is the case.

Briefly, but clearly, explain what Compaction is and why we need to use it$.$

Select all of the following that are dynamic storage allocation strategies$/$algorithms$.$

Group of answer choices

First Fit

Best fit

Last$-$fit

round$-$robin$-$fit

Multiple Fit

reverse fit

Worst Fit