List-I (Strategy) A. First-Fit B. Best-Fit C. Worst-Fit D. Compaction List-II (Placement Rule) Allocates the largest available partition hole that fits. Allocates the first available partition hole large enough. Allocates the smallest available partition hole that fits closely. Shifts memory contents to merge fragmented free blocks together.

A-2, B-3, C-1, D-4 Explanation: Each memory allocation strategy is defined as follows: A. First-Fit 2 : Searches from the beginning of memory and allocates the first available hole that is large enough for the process. B. Best-Fit 3 : Searches the entire list of free holes and allocates the smallest available hole that fits the process closely, leaving behind the smallest leftover hole. C. Worst-Fit 1 : Searches the entire list and allocates the largest available hole , leaving behind the largest leftover hole (which may be useful for other processes). D. Compaction 4 : Relocates memory contents to place all free memory blocks together into one large contiguous block to resolve external fragmentation. Therefore, the correct mapping is A-2, B-3, C-1, D-4 .

How do I solve CUET PG 2026 operating system os questions?

Practice CUET PG 2026 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 2026 — operating system os PYQ

CUET PG | operating system os | 2026

List-I (Strategy)

A. First-Fit

B. Best-Fit

C. Worst-Fit

D. Compaction

List-II (Placement Rule)

Allocates the largest available partition hole that fits.

Allocates the first available partition hole large enough.

Allocates the smallest available partition hole that fits closely.

Shifts memory contents to merge fragmented free blocks together.

Choose the correct answer: