Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB, 25 KB, 18 KB, 7 KB, 9 KB, 15 KB, and 12 KB. Assume that no two holes are adjacent. Two processes P1 of size 16 KB and P2 of size 9 KB arrive in that order, and they are allocated memory using the best-fit technique. After allocating space to P1 and P2, the number of holes of size less than 8 KB is ________. (answer in integer)
Note: 1K =
GATE CS 2026 (Afternoon) — Question 55
Operating Systems (OS)Memory Management and Virtual MemoryNAT2 marksMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Memory Management and Virtual Memory
- GATE CS 2026 (Afternoon) · Q54A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory tha…
- GATE CS 2025 (Forenoon) · Q14Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assumi…
- GATE CS 2025 (Forenoon) · Q54In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modificati…
- GATE CS 2025 (Afternoon) · Q47Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the…
- GATE CS 2025 (Afternoon) · Q58A computer system supports a logical address space of 2 32 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A l…
- GATE CS 2024 (Forenoon) · Q62Consider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Assume…

