GATE CSE 2022 | Memory Management Question 2 | Operating Systems

GATE CSE 2022

MCQ (Single Correct Answer)

-0.33

Which one of the following statements is FALSE?

The TLB performs an associative search in parallel on all its valid entries using page number of incoming virtual address.

If the virtual address of a word given by CPU has a TLB hit, but the subsequent search for the word results in a cache miss, then the word will always be present in the main memory.

The memory access time using a given inverted page table is always same for all incoming virtual addresses.

In a system that uses hashed page tables, if two distinct virtual addresses V1 and V2 map to the same value while hashing, then the memory access time of these addresses will not be the same.

GATE CSE 2022

Numerical

-0.33

Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string

7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1, 5, 6, 1

the page fault rate, defined as the ratio of number of page faults to the number of memory accesses (rounded off to one decimal place) is _____________.

Your input ____

GATE CSE 2020

MCQ (Single Correct Answer)

-0.33

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?

The hole created by worst fit is always larger than the hole created by first fit.

The hole created by best fit is never larger than the hole created by first fit.

The hole created by first fit is always larger than the hole created by next fit.

The hole created by next fit is never larger than the hole created by best fit.

GATE CSE 2016 Set 2

MCQ (Single Correct Answer)

-0.3

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

$$LRU$$ (Least Recently Used)

$$OPT$$ (Optimal Page Replacement)

$$MRU$$ (Most Recently Used)

$$FIFO$$ (First In First Out)

PREVIOUS NEXT