Address Binding Timelines List-I (Binding Phase) A. Compile Time B. Load Time C. Execution Time D. Hardware Requirement List-II (Resulting Address Format) Generates absolute physical addresses; code cannot be relocated Generates relocatable addresses; absolute addresses are bound when loaded Bound during runtime; process can move across memory segments Run-time binding requires explicit memory-mapping hardware (MMU)

A-1, B-2, C-3, D-4 Explanation: A. Compile Time 1 Explanation: If memory location is known a priori, absolute code can be generated at compile time. It generates absolute physical addresses and code cannot be relocated. B. Load Time 2 Explanation: If memory location is not known at compile time, the compiler must generate relocatable code. In this case, final absolute addresses are bound only when the program is loaded. C. Execution Time 3 Explanation: If the process can be moved during its execution from one memory segment to another, binding is delayed until runtime. D. Hardware Requirement 4 Explanation: Run-time address binding requires special hardware support, such as a Memory Management Unit (MMU), to map virtual addresses to physical addresses dynamically. Therefore, the correct matching sequence is A-1, B-2, C-3

How do I solve CUET PG operating system os questions?

Practice CUET PG operating system os previous year questions with step-by-step solutions on Mathem Solvex. Each question includes a detailed explanation and video solution to help you master the concept quickly.

What is the difficulty level of CUET PG operating system os questions?

CUET PG operating system os questions range from moderate to advanced difficulty. Consistent practice with official previous year papers and topic-wise drills on Mathem Solvex is the most effective preparation strategy.

Are CUET PG previous year papers available for free?

Yes. Mathem Solvex provides free access to CUET PG previous year question papers and topic-wise PDFs. You can download them or attempt them as timed live mock tests directly on the platform.

CUET PG — operating system os PYQ

CUET PG | operating system os |

Address Binding Timelines

List-I (Binding Phase)

A. Compile Time

B. Load Time

C. Execution Time

D. Hardware Requirement

List-II (Resulting Address Format)

Generates absolute physical addresses; code cannot be relocated

Generates relocatable addresses; absolute addresses are bound when loaded

Bound during runtime; process can move across memory segments

Run-time binding requires explicit memory-mapping hardware (MMU)

Choose the correct answer: