Dynamic Allocation Strategies List-I (Placement Strategy) A. First-Fit B. Best-Fit C. Worst-Fit D. Next-Fit List-II (Block Selection Rule) Allocates the first free block that is large enough Allocates the smallest free block that is large enough Allocates the largest free block available, leaving a large leftover chunk Similar to First-Fit, but starts searching from the location of the last allocation

A-1, B-2, C-3, D-4 Explanation: A. First-Fit 1 Explanation: First-Fit searches from the beginning of the free list and allocates the first free block that is large enough to satisfy the process memory request. B. Best-Fit 2 Explanation: Best-Fit searches the entire list to find and allocate the smallest free block that is large enough , minimizing the size of the leftover fragment. C. Worst-Fit 3 Explanation: Worst-Fit allocates the largest free block available , leaving a large leftover chunk that may still be useful for other allocation requests. D. Next-Fit 4 Explanation: Next-Fit is similar to First-Fit, but instead of always starting from the beginning, it starts searching from the location of the last allocation . Therefore, the correct matching sequence is A-1, B-2, C-3, D-4 .

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 Allocation Strategies

List-I (Placement Strategy)

A. First-Fit

B. Best-Fit

C. Worst-Fit

D. Next-Fit

List-II (Block Selection Rule)

Allocates the first free block that is large enough

Allocates the smallest free block that is large enough

Allocates the largest free block available, leaving a large leftover chunk

Similar to First-Fit, but starts searching from the location of the last allocation

Choose the correct answer: