Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vinay chauhan
0
votes
1
operating system cpu utilization
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking on i/o. if s<q<r, then cpu efficiency? a )q/q+s b) q/r+s c) r/r+s d) qr/r+s
in a round robin scheduling s represents the time of context switching, q represents the time quantum and r represents the average time the process runs before blocking o...
2.8k
views
answered
Jan 27, 2019
Operating System
operating-system
context-switch
process-scheduling
+
–
0
votes
2
theory of computation
Which of the following problems is/are P-problems? I. Equivalence of DFA's II. Equivalence of NFA III. Equivalence of RE (a) Only I (b) Only I and II (c) Only II and III (d) All
Which of the following problems is/are P-problems?I. Equivalence of DFA'sII. Equivalence of NFAIII. Equivalence of RE(a) Only I(b) Only I and II(c) Only II and III(d) All...
343
views
answered
Jan 25, 2019
4
votes
3
GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ ... a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? $3$ $4$ $5$ $6$
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ respectively in chronological order: $“a_s \: b_s \: c_s \: a_e \: d_s \: c_...
14.5k
views
answered
Aug 13, 2018
Algorithms
gatecse-2003
algorithms
normal
greedy-algorithm
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register