Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
jenny101
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by jenny101
9
votes
1
GATE CSE 2017 Set 1 | Question: 18
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
Threads of a process shareglobal variables but not heapheap but not global variablesneither global variables nor heapboth heap and global variables
16.8k
views
answered
Feb 12, 2017
Operating System
gatecse-2017-set1
operating-system
threads
+
–
5
votes
2
gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?
does Random page replacement algorithm suffers from belady's anomaly?
3.2k
views
answered
Feb 11, 2017
2
votes
3
GATE Overflow | Operating Systems | Test 1 | Question: 13
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is 100 ns 68.0 ns 68.5 ns 78.5 ns
In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is 100 ns. The time required to access a page in primary memory is 1...
775
views
answered
Oct 11, 2016
Operating System
go-os-1
virtual-memory
paging
+
–
4
votes
4
GATE Overflow | Operating Systems | Test 1 | Question: 12
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is - $e^-{15}$ $e^{-5}$ $1 - e^{-5}$ $1-e^{-10}$
In a multi-user operating system, 20 requests are made to use a particular resource per hour, on average. The probability that no requests are made in 45 minutes is -$e^-...
729
views
answered
Oct 11, 2016
Operating System
go-os-1
operating-system
resource-allocation
+
–
0
votes
5
which of the following is correct with respect to two phase commit protocol
1.9k
views
answered
Jun 23, 2016
2
votes
6
GATE CSE 2000 | Question: 7
Construct as minimal finite state machine that accepts the language, over $\{0,1\}$, of all strings that contain neither the substring $00$ nor the substring $11$. Consider the grammar $S \to aSAb $ $S \to \epsilon $ $A \to bA $ $ A \to \epsilon $ where $S$ ... $i, j \geq 0$, where $i$ and $j$ satisfy some condition. What is the condition on the values of $i$ and $j$?
Construct as minimal finite state machine that accepts the language, over $\{0,1\}$, of all strings that contain neither the substring $00$ nor the substring $11$.Conside...
4.6k
views
answered
Apr 30, 2016
Theory of Computation
gatecse-2000
theory-of-computation
descriptive
regular-language
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register