1
GATE CSE 2015 Set 2
+2
-0.6
Consider six memory partitions of sizes $$200$$ $$KB,$$ $$400$$ $$KB,$$ $$600$$ $$KB,$$ $$500$$ $$KB,$$ $$300$$ $$KB$$ and $$250$$ $$KB,$$ where $$KB$$ refers to kilobyte. These partitions need to be allotted to four processes of sizes $$357$$ $$KB,$$ $$210$$ $$KB,$$ $$468$$ $$KB$$ and $$491$$ $$KB$$ in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?
A
$$200$$ $$KB$$ and $$300$$ $$KB$$
B
$$200$$ $$KB$$ and $$250$$ $$KB$$
C
$$250$$ $$KB$$ and $$300$$ $$KB$$
D
$$300$$ $$KB$$ and $$400$$ $$KB$$
2
GATE CSE 2014 Set 1
Numerical
+2
-0
Assume that there are $$3$$ page frames which are initially empty. If the page reference string is $$1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6,$$ the number of page faults using the optimal replacement policy is______________.
3
GATE CSE 2014 Set 3
Numerical
+2
-0
Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is______________.
4
GATE CSE 2014 Set 2
+2
-0.6
A computer has twenty physical page frames which contain pages numbered $$101$$ through $$120.$$ Now a program accesses the pages numbered $$1, 2, …, 100$$ in that order, and repeats the access sequence THRICE. Which one of the following page replacement policies experiences the same number of page faults as the optimal page replacement policy for this program?
A
Least-recently-used
B
First-In-First-Out
C
Least-in-first-out
D
None
GATE CSE Subjects
EXAM MAP
Medical
NEET