In memory management, which of the following allows non-contiguous memory allocation?

Q: How do I solve CUET PG 2026 Computer questions?

Practice CUET PG 2026 Computer 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.

Q: What is the difficulty level of CUET PG Computer questions?

CUET PG Computer 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.

Q: 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.

Question

In memory management, which of the following allows non-contiguous memory allocation?

Vivek Kumar · Accepted Answer

paging Explanation: Solution: Paging is a storage mechanism that allows the OS to retrieve processes from secondary storage into main memory in the form of pages. In this method, a process is divided into fixed-size blocks called pages , and physical memory is divided into fixed-size blocks called frames . Since any page can be placed in any available frame, the process does not need to be stored in a single, continuous block of memory. This is the definition of non-contiguous allocation . In contrast, Partition and Variable (referring to fixed/variable partitioning) usually follow contiguous allocation schemes. Address binding is simply the process of mapping one address space to another. Correct Option: (a) paging

Mathem Solvex

CUET PG 2026 — Computer PYQ

Choose the correct answer:

Explanation

Explanation