All MCQs

Worst fit uses the largest hole in an attempt to leave a sizable remainder.
It requires finding the largest suitable free region.

Best fit searches for the tightest hole that can contain the process.
It may leave many very small unusable fragments.

First fit scans memory and uses the earliest hole that satisfies the request.
It often performs faster than strategies that search all holes.

Variable partitioning allocates contiguous holes sized according to arriving process needs.
As processes enter and leave, external fragmentation can develop.

Fixed partitions have predetermined boundaries and sizes established before process placement.
A process must fit in one available partition, which can cause internal fragmentation.

Single-partition allocation supports only one resident user process in the available user-memory region.
It is simple but provides poor multiprogramming and memory utilization.

Roll out, roll in uses swapping to make memory available for a more urgent process.
The lower-priority process is restored when sufficient memory becomes available.

Swapping frees main memory by transferring inactive process contents to a backing store.
The process can later be brought back into memory and resumed.

Dynamic linking uses a small runtime stub to locate and bind a shared library routine when needed.
It supports library sharing and updates without embedding every routine in each executable.

Dynamic loading keeps unused routines out of memory until execution actually requires them.
This can reduce the process's memory footprint for large programs with rarely used code.

The memory-management unit performs hardware-supported address translation and protection checks.
It sits between processor-generated addresses and physical memory.

Execution-time binding translates addresses dynamically during every memory reference.
Hardware support such as an MMU allows the process to relocate while executing.