Memory Management

Question 1
Consider a three-level page table to translate a 39-bit virtual address to a physical address as shown below:

The page size is 4 KB = (1KB =2^{10} bytes) and page table entry size at every level is 8 bytes. A process P is currently using 2 GB (1 GB =2^{30} bytes) virtual memory which os mapped to 2 GB of physical memory. The minimum amount of memory required for the page table of P across all levels is _________ KB
A
1024
B
4096
C
4108
D
1864
GATE CSE 2021 SET-2   Operating System
Question 2
In the context of operating systems, which of the following statements is/are correct with respect to paging?
[MSQ]
A
Paging helps solve the issue of external fragmentation
B
Page size has no impact on internal fragmentation
C
Paging incurs memory overheads
D
Multi-level paging is necessary to support pages of different sizes
GATE CSE 2021 SET-1   Operating System
Question 3
Consider the following page reference string.
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
What are the minimum number of frames required to get a single page fault for the above sequence assuming LRU replacement strategy?
A
7
B
4
C
6
D
5
ISRO CSE 2020   Operating System
Question 4
What is compaction refers to
A
a technique for overcoming internal fragmentation
B
a paging technique
C
a technique for overcoming external fragmentation
D
a technique for compressing the data
ISRO CSE 2020   Operating System
Question 5
Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB lookup takes 20 ns. Each page transfer to/from the disk takes 5000 ns. Assume that the TLB hit ratio is 95%, page fault rate is 10%. Assume that for 20% of the total page faults, a dirty page has to be written back to disk before the required page is read from disk. TLB update time is negligible. The average memory access time in ns (round off to 1 decimal places) is ___________
A
725
B
155
C
715
D
125
GATE CSE 2020   Operating System
Question 6
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 statement is TRUE?
A
The hole created by first fit is always larger than the hole created by next fit.
B
The hole created by worst fit is always larger than the hole created by first fit.
C
The hole created by best fit is never larger than the hole created by first fit.
D
The hole created by next fit is never larger than the hole created by best fit.
GATE CSE 2020   Operating System
Question 7
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 8kB 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?
A
16 \times 2^{10}
B
256 \times 2^{10}
C
4 \times 2^{20}
D
8 \times 2^{20}
GATE CSE 2019   Operating System
Question 8
The Operating System of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called:
A
Concatenation
B
Garbage Collection
C
Collision
D
Dynamic Memory Allocation
ISRO CSE 2018   Operating System
Question 9
A computer has 1000K of main memory. The jobs arrive and finish in the following sequence.
Job 1 requiring 200 K arrives
Job 2 requiring 350 K arrives
Job 3 requiring 300 K arrives
Job 1 finishes
Job 4 requiring 120 K arrives
Job 5 requiring 150 K arrives
Job 6 requiring 80 K arrives
Among best fit and first fit, which performs better for this sequence?
A
First fit
B
Best fit
C
Both perform the same
D
None of the above
ISRO CSE 2018   Operating System
Question 10
Determine the number of page faults when references to pages occur in the order 1,2,4,5,2,1,2,4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 brought earlier than page 2. (assume LRU i.e., Least-Recently-Used algorithm is applied)
A
3
B
4
C
5
D
None of the above
ISRO CSE 2018   Operating System


There are 10 questions to complete.

Leave a Comment

Like this FREE website? Please share it among all your friends and join the campaign of FREE Education to ALL.