1
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?
A
1
B
2
C
3
D
6
2
GATE CSE 2015 Set 2
Numerical
+1
-0
A computer system implements a $$40$$-bit virtual address, page size of $$8$$ kilobytes, and a $$128$$-entry translation look-aside buffer $$(TLB)$$ organized into $$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 ________________.
Your input ____
3
GATE CSE 2015 Set 2
Numerical
+2
-0
A computer system implements $$8$$ kilobyte pages and a $$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$$ megabytes, the length of the virtual address supported by the system is _______________ bits.
Your input ____
4
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+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$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12