Correct Answer: C. Loading a routine into memory only when it is first called
Explanation:
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.
Correct Answer: A. An address generated by the CPU from a process's virtual address space
Explanation:
A logical address is the address a program uses before translation by the memory-management system.
It may differ from the physical address used by main memory hardware.
Correct Answer: C. When the program's final memory location is known during compilation
Explanation:
Compile-time binding lets the compiler generate absolute addresses for a known load location.
If the location changes, the program generally must be recompiled.
Correct Answer: D. Its maximum possible demand for each resource type
Explanation:
Banker's algorithm tests whether granting a request would leave the system in a safe state.
To perform that test, it needs declared maximum claims as well as current allocations and availability.
Correct Answer: A. An ordering of processes in which each can obtain its remaining needs, finish, and release resources
Explanation:
A safe sequence demonstrates that current resources and later releases can satisfy every process in turn.
Its existence proves the state is safe under the avoidance model.
Correct Answer: B. Available resources, current allocations, and outstanding requests
Explanation:
The detection procedure simulates which processes can finish with current availability and subsequent releases.
Processes that cannot be marked finishable may be involved in deadlock.
Correct Answer: C. Terminate all deadlocked processes or abort selected victims until the cycle is removed
Explanation:
Process termination releases the victim's resources and can destroy the circular dependency.
Victim selection may consider priority, completed work, resource use, and restart cost.
Correct Answer: D. Selecting victims and preventing the same process from being repeatedly rolled back
Explanation:
Preemption may require rolling a victim back to a safe checkpoint and reclaiming its resources.
A fair cost policy is needed to avoid repeated victimization and starvation.
Correct Answer: D. Prevention structurally denies a necessary condition, while avoidance grants requests only when the resulting state remains safe
Explanation:
Deadlock prevention designs the resource rules so at least one necessary condition cannot hold.
Deadlock avoidance evaluates each request using future maximum needs and safe-state analysis.
Correct Answer: A. Require a process to request all needed resources before it begins or only when holding none
Explanation:
Requiring an all-at-once request or a no-hold request rule prevents a process from waiting while retaining resources.
The policy may reduce utilization because resources can be reserved earlier than needed.