Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for isro2016+operating-system
46
votes
3
answers
1
GATE CSE 2006 | Question: 62, ISRO2016-50
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a translation look-aside buffer (TLB) which can hold a total of $128$ page table en...
Rucha Shelke
25.9k
views
Rucha Shelke
asked
Sep 26, 2014
Operating System
gatecse-2006
operating-system
virtual-memory
normal
isro2016
+
–
20
votes
5
answers
2
GATE CSE 2009 | Question: 9, ISRO2016-52
In which one of the following page replacement policies, Belady's anomaly may occur? FIFO Optimal LRU MRU
In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU
Kathleen
8.6k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
page-replacement
normal
isro2016
+
–
25
votes
4
answers
3
GATE CSE 2007 | Question: 11, ISRO2009-36, ISRO2016-21
Consider a disk pack with $16$ surfaces, $128$ tracks per surface and $256$ sectors per track. $512$ bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular ... $256$ Mbyte, $19$ bits $256$ Mbyte, $28$ bits $512$ Mbyte, $20$ bits $64$ Gbyte, $28$ bits
Consider a disk pack with $16$ surfaces, $128$ tracks per surface and $256$ sectors per track. $512$ bytes of data are stored in a bit serial manner in a sector. The capa...
Kathleen
20.8k
views
Kathleen
asked
Sep 21, 2014
Operating System
gatecse-2007
operating-system
disk
normal
isro2016
+
–
17
votes
2
answers
4
ISRO2016-51
For the real time operating system, which of the following is the most suitable scheduling scheme? Round robin First come first serve Pre-emptive Random scheduling
For the real time operating system, which of the following is the most suitable scheduling scheme?Round robinFirst come first servePre-emptiveRandom scheduling
go_editor
9.2k
views
go_editor
asked
Jul 6, 2016
Operating System
isro2016
operating-system
process-scheduling
+
–
14
votes
5
answers
5
ISRO2016-46
With single resource, deadlock occurs if there are more than two processes competing for that resources if there are only two processes competing for that resources if there is a single process competing for that resources none of these
With single resource, deadlock occursif there are more than two processes competing for that resourcesif there are only two processes competing for that resourcesif there...
asu
9.2k
views
asu
asked
Jul 4, 2016
Operating System
operating-system
resource-allocation
isro2016
+
–
5
votes
4
answers
6
ISRO2016-48
Determine the number of page faults when references to pages occur in the following 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 one having brought earlier than page 2. (LRU page replacement algorithm is used) 3 5 4 None of these
Determine the number of page faults when references to pages occur in the following order:1, 2, 4, 5, 2, 1, 2, 4Assume that the main memory can accommodate 3 pages and th...
habedo007
8.3k
views
habedo007
asked
Jul 5, 2016
Operating System
page-replacement
page-fault
isro2016
operating-system
+
–
9
votes
7
answers
7
ISRO2016-47
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then Deadlock can never occur Deadlock may occur Deadlock has to occur None of these
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, thenDeadlock can never occurDeadlock may occurDeadlock has to occurNone of these...
asu
11.0k
views
asu
asked
Jul 4, 2016
Operating System
operating-system
resource-allocation
isro2016
+
–
8
votes
3
answers
8
ISRO2016-45
At a particular time of computation the value of a counting semaphore is 7. Then 20 $P$ operations and $x$ $V$ operations were completed on this semaphore. If the new value of semaphore is $5$, $x$ will be 18 22 15 13
At a particular time of computation the value of a counting semaphore is 7. Then 20 $P$ operations and $x$ $V$ operations were completed on this semaphore. If the new val...
Arjun
10.9k
views
Arjun
asked
Jul 6, 2016
Operating System
operating-system
process-synchronization
semaphore
isro2016
+
–
9
votes
5
answers
9
ISRO2016-22
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, what is the effective access time for the memory? 21.4 ns 29.9 ns 23.5 ns 35.1 ns
Let the page fault service time be $10$ ms in a computer with average memory access time being $20$ ns. If one page fault is generated for every $10^6$ memory accesses, w...
sourav.
6.5k
views
sourav.
asked
Jul 3, 2016
Operating System
operating-system
virtual-memory
paging
isro2016
+
–
6
votes
2
answers
10
ISRO2016-49
Working Set $(t,k)$ at an instant of time $t$ is the set of $k$ future references that the OS will make the set of future references that the OS will make in next $t$ unit of time the set of $k$ references with high frequency the $k$ set of pages that have been referenced in the last $t$ time units
Working Set $(t,k)$ at an instant of time $t$ isthe set of $k$ future references that the OS will makethe set of future references that the OS will make in next $t$ unit ...
Desert_Warrior
6.3k
views
Desert_Warrior
asked
Jul 3, 2016
Operating System
operating-system
page-replacement
isro2016
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register