Crack
GATE
C
G
Topic
Memory Management and Virtual Memory
Operating System
0
/ 23 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
1.7
0.7
0
1
2018
0
0
0
0
2019
1
1
0
0
2020
2
1
0
1
2021
1
0
0.5
0.5
2022
2
1
0
1
2023
2
0
0
2
2024
1.5
0
0.5
1
2025
2
0.5
0.5
1
2026
1
0
0
1
1
CS 2026 Set 2 · 2 marks · NAT · Moderate
A system has a Translation Lookaside Buffer (TLB) that has a reach of
1
M
B
1\,\mathrm{MB}
1
MB
. TLB reach is defined as the total amount of physical memory that can be accessed through the TLB entries. The paging system uses pages of size
4
K
B
4\,\mathrm{KB}
4
KB
. The virtual address space is
64
G
B
64\,\mathrm{GB}
64
GB
and physical address space is
1
G
B
1\,\mathrm{GB}
1
GB
. If each TLB entry stores a 4-bit process id, page number, frame number, and a 2-bit control field, then the size of the TLB (in bytes) is _____. (answer in integer)
2
CS 2026 Set 2 · 2 marks · NAT · Moderate
Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are
8
8
8
holes in the memory of sizes
20
K
B
20\,\mathrm{KB}
20
KB
,
4
K
B
4\,\mathrm{KB}
4
KB
,
25
K
B
25\,\mathrm{KB}
25
KB
,
18
K
B
18\,\mathrm{KB}
18
KB
,
7
K
B
7\,\mathrm{KB}
7
KB
,
9
K
B
9\,\mathrm{KB}
9
KB
,
15
K
B
15\,\mathrm{KB}
15
KB
, and
12
K
B
12\,\mathrm{KB}
12
KB
. Assume that no two holes are adjacent. Two processes
P
1
\mathrm{P1}
P1
of size
16
K
B
16\,\mathrm{KB}
16
KB
and
P
2
\mathrm{P2}
P2
of size
9
K
B
9\,\mathrm{KB}
9
KB
arrive in that order, and they are allocated memory using the best-fit technique. After allocating space to
P
1
\mathrm{P1}
P1
and
P
2
\mathrm{P2}
P2
, the number of holes of size less than
8
K
B
8\,\mathrm{KB}
8
KB
is
_
_
_
_
_
\_\_\_\_\_
_____
. (answer in integer)
3
CS 2025 Set 1 · 1 mark · MCQ · Moderate
Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory is byte addressable, what is the maximum number of entries in the page table?
4
CS 2025 Set 1 · 2 marks · NAT · Hard
In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal page replacement algorithm is as follows:
5
CS 2025 Set 2 · 2 marks · MSQ · Hard
Consider 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
1\ 2\ 3\ 4\ 5\ 4\ 1\ 6\ 4\ 5\ 1\ 3\ 2
1
2
3
4
5
4
1
6
4
5
1
3
2
. The contents of the frames are as follows initially and after each reference (from left to right):
6
CS 2025 Set 2 · 2 marks · NAT · Moderate
A computer system supports a logical address space of
2
32
2^{32}
2
32
bytes. It uses two-level hierarchical paging with a page size of
4096
4096
4096
bytes. A logical address is divided into a
b
b
b
-bit index to the outer page table, an offset within the page of the inner page table, and an offset within the desired page. Each entry of the inner page table uses eight bytes. All the pages in the system have the same size.
7
CS 2024 Set 1 · 2 marks · NAT · Easy
Consider a memory management system that uses a page size of
2
K
B
2\,\mathrm{KB}
2
KB
. Assume that both the physical and virtual addresses start from
0
0
0
. Assume that the pages
0
0
0
,
1
1
1
,
2
2
2
, and
3
3
3
are stored in the page frames
1
1
1
,
3
3
3
,
2
2
2
, and
0
0
0
, respectively. The physical address (in decimal format) corresponding to the virtual address
2500
2500
2500
(in decimal format) is ____.
8
CS 2024 Set 2 · 1 mark · MSQ · Moderate
Which of the following tasks is/are the responsibility/responsibilities of the memory management unit (MMU) in a system with paging-based memory management?
9
CS 2024 Set 2 · 2 marks · NAT · Hard
Consider a 32-bit system with
4
K
B
4\,\mathrm{KB}
4
KB
page size and page table entries of size
4
4
4
bytes each. Assume
1
K
B
=
2
10
1\,\mathrm{KB} = 2^{10}
1
KB
=
2
10
bytes. The OS uses a 2-level page table for memory management, with the page table containing an outer page directory and an inner page table. The OS allocates a page for the outer page directory upon process creation. The OS uses demand paging when allocating memory for the inner page table, i.e., a page of the inner page table is allocated only if it contains at least one valid page table entry.
10
CS 2023 · 2 marks · NAT · Hard
Consider the following two-dimensional array
D
D
D
in the C programming language, which is stored in row-major order:
11
CS 2023 · 2 marks · NAT · Easy
Consider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with
L
L
L
levels for virtual to physical address translation. The page size is 4 KB (1 KB = 1024 B) and a page table entry at any of the levels occupies 8 bytes.
12
CS 2022 · 2 marks · MCQ · Hard
Which one of the following statements is FALSE?
13
CS 2022 · 2 marks · NAT · Moderate
Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string
14
CS 2021 Set 1 · 1 mark · MSQ · Moderate
In the context of operating systems, which of the following statements is/are correct with respect to paging?
15
CS 2021 Set 2 · 2 marks · NAT · Moderate
Consider a three-level page table to translate a 39-bit virtual address to a physical address as shown below.
16
CS 2020 · 1 mark · MCQ · Easy
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statements is TRUE?
17
CS 2020 · 2 marks · NAT · Hard
Consider a paging system that uses
1
1
1
-level page table residing in main memory and a TLB for address translation. Each main memory access takes
100
n
s
100\,\mathrm{ns}
100
ns
and TLB lookup takes
20
n
s
20\,\mathrm{ns}
20
ns
. Each page transfer to/from the disk takes
5000
n
s
5000\,\mathrm{ns}
5000
ns
. Assume that the TLB hit ratio is
95
%
95\%
95%
, page fault rate is
10
%
10\%
10%
. Assume that for
20
%
20\%
20%
of the total page faults, a dirty page has to be written back to disk before the required page is read in from disk. TLB update time is negligible. The average memory access time in
n
s
\mathrm{ns}
ns
(round off to
1
1
1
decimal places) is _____.
18
CS 2019 · 2 marks · MCQ · Moderate
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is
8
k
B
8\,\mathrm{kB}
8
kB
and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?
19
CS 2015 Set 1 · 1 mark · NAT · Easy
Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is
20
CS 2015 Set 1 · 2 marks · MCQ · Moderate
Consider a main memory with five page frames and the following sequence of page references:
3
,
8
,
2
,
3
,
9
,
1
,
6
,
3
,
8
,
9
,
3
,
6
,
2
,
1
,
3
3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3
3
,
8
,
2
,
3
,
9
,
1
,
6
,
3
,
8
,
9
,
3
,
6
,
2
,
1
,
3
. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?
21
CS 2015 Set 2 · 1 mark · NAT · Moderate
A computer system implements a
40
40
40
-bit virtual address, page size of
8
k
B
8\,\mathrm{kB}
8
kB
, and a
128
128
128
-entry translation look-aside buffer (TLB) organized into
32
32
32
sets each having four ways. Assume that the TLB tag does not store any process id. The minimum length of the TLB tag in bits is _____
22
CS 2015 Set 2 · 2 marks · MCQ · Moderate
Consider six memory partitions of sizes
200
K
B
200\,\mathrm{KB}
200
KB
,
400
K
B
400\,\mathrm{KB}
400
KB
,
600
K
B
600\,\mathrm{KB}
600
KB
,
500
K
B
500\,\mathrm{KB}
500
KB
,
300
K
B
300\,\mathrm{KB}
300
KB
and
250
K
B
250\,\mathrm{KB}
250
KB
, where
K
B
\mathrm{KB}
KB
refers to kilobyte. These partitions need to be allotted to four processes of sizes
357
K
B
357\,\mathrm{KB}
357
KB
,
210
K
B
210\,\mathrm{KB}
210
KB
,
468
K
B
468\,\mathrm{KB}
468
KB
and
491
K
B
491\,\mathrm{KB}
491
KB
in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
23
CS 2015 Set 2 · 2 marks · NAT · Moderate
A computer system implements
8
k
i
l
o
b
y
t
e
8\,\mathrm{kilobyte}
8
kilobyte
pages and a
32
32
32
-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation. If the maximum size of the page table of a process is
24
m
e
g
a
b
y
t
e
s
24\,\mathrm{megabytes}
24
megabytes
, the length of the virtual address supported by the system is __________ bits.