Dynamic Partition Allocation Maths List-I (Allocation Scenario) A. Best-Fit Trap B. Worst-Fit Benefit C. First-Fit Advantage D. 50-Percent Rule List-II (Resulting System State) Leaves behind tiny, unusable fragments of free memory Leaves behind large leftover holes that are easy for other processes to reuse Fast execution; avoids searching the entire memory layout Given ( ) allocated blocks, another ( ) blocks are lost to fragmentation

A-1, B-2, C-3, D-4 Explanation: A. Best-Fit Trap 1 Explanation: The Best-Fit strategy searches the entire list to find the smallest adequate block, which frequently leaves behind tiny, unusable fragments of free memory (splinters) that are too small to satisfy subsequent requests. B. Worst-Fit Benefit 2 Explanation: Worst-Fit allocates the largest available hole, which leaves behind large leftover holes that remain large enough for other incoming processes to reuse effectively. C. First-Fit Advantage 3 Explanation: First-Fit provides fast execution because it stops searching and allocates the first block that fits, avoiding the need to search the entire memory layout. D. 50-Percent Rule 4 Explanation: According to statistical analysis of contiguous memory allocation (the 50-percent rule), given allocated blocks, another

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 |

Dynamic Partition Allocation Maths

List-I (Allocation Scenario)

A. Best-Fit Trap

B. Worst-Fit Benefit

C. First-Fit Advantage

D. 50-Percent Rule

List-II (Resulting System State)

Leaves behind tiny, unusable fragments of free memory

Leaves behind large leftover holes that are easy for other processes to reuse

Fast execution; avoids searching the entire memory layout

Given ( $N$ ) allocated blocks, another ( $0.5 N$ ) blocks are lost to fragmentation

Choose the correct answer: