Ultimate Quiz on Memory Management and Addressing Modes Quiz

1. Identifying Paging Concepts

   Which statement best describes the concept of paging in memory management?

   1. Memory is divided into fixed-size blocks called pages.
   2. Memory is allocated in variable-size blocks called segments.
   3. Addresses are directly mapped to secondary storage.
   4. System allocates memory to processes on a first-come basis.
   5. Every process has continuous blocks of memory allocation.

2. Base Register Function

   In memory management, what role does the base register play?

   1. It stores the starting address of the process in memory.
   2. It points to the last address space used by the process.
   3. It is used to swap processes in and out of disk storage.
   4. It contains the memory address of the operating system kernel.
   5. It holds the value of the next free memory block.

3. Understanding Immediate Addressing

   In immediate addressing mode, where is the operand specified?

   1. Within the instruction itself.
   2. At the address pointed to by a register.
   3. In the main memory location provided by the instruction.
   4. At the address obtained after adding two registers.
   5. Stored in the RAM buffer.

4. Segmented Memory Typos

   Which option correctly defines segmented memory management?

   1. Memory is divided into variable-length segments based on logical divisions.
   2. Memory is split into equal-sized pages regardless of process needs.
   3. Segments are always of 4KB size.
   4. Processes cannot share segments between each other.
   5. Each process is always allocated one contiguous memory block.

5. Direct Addressing Errors

   What is a main characteristic of direct addressing mode?

   1. The address field contains the effective memory address of the operand.
   2. The operand is always located in the register bank.
   3. Addresses are calculated by multiplying offsets and base.
   4. The instruction refers to data indirectly via stack pointer.
   5. Only constant values are accepted as operands.

6. Page Replacement Scenario

   Which page replacement algorithm replaces the page that has not been used the longest?

   1. Least Recently Used (LRU)
   2. First-In First-Out (FIO)
   3. Most Frequently Used (MFU)
   4. Random Order Paging
   5. Last-In First-Out (LIIFO)

7. Indexed Addressing Mode Code

   Given the instruction MOV A, 2000[X], which addressing mode is used here?

   1. Indexed addressing mode
   2. Immediate addressing mode
   3. Indirect addressing mode
   4. Base register addressing mode
   5. Register direct addressing mode

8. Thrashing Conceptualization

   What does the term 'thrashing' refer to in memory management?

   1. Excessive paging activity slowing down the system.
   2. A process holding the CPU for too long.
   3. Frequent context switching between user and kernel modes.
   4. Allocation of memory to read-only processes.
   5. Swapping out inactive processes once every hour.

9. Relative Addressing Mode Typos

   In relative addressing mode, how is the effective address calculated?

   1. By adding a constant value (displacement) to the program counter.
   2. By multiplying two address registers.
   3. By using only absolute memory addresses.
   4. By referencing the top value on the stack.
   5. By subtracting offset from the accumulator register.

10. Multi-level Paging

    Which is a key advantage of using multi-level paging in memory management?

    1. It reduces the size of page tables stored in main memory.
    2. It increases the external fragmentation of memory.
    3. It ensures every process receives identical memory blocks.
    4. It completely eliminates the need for page tables.
    5. It makes address translation slower and more complex.