1
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Consider $$n$$ processes sharing the $$CPU$$ in a round-robin fashion. Assuming that each process switch takes $$s$$ seconds, what must be the quantum size $$q$$ such that the overhead resulting from process switching is minimized but, at the same time each process is guaranteed to get its turn at the $$CPU$$ at least every $$t$$ seconds?
A
$$q \le {{t - ns} \over {n - 1}}$$
B
$$q \ge {{t - ns} \over {n - 1}}$$
C
$$q \le {{t - ns} \over {n + 1}}$$
D
$$q \ge {{t - ns} \over {n + 1}}$$
2
GATE CSE 1998
Subjective
+2
-0
Four jobs are waiting to be run. Their expected run times are $$6, 3, 5$$ and $$x$$. $${\rm I}$$n what order should they be run to minimize the average response time?
3
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
When the result of a computation depends on the speed of the processes involved there is said to be
A
Cycle stealing
B
Race condition
C
A time clock
D
A deadlock
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4 V (signal) operations were completed on this semaphore. The resulting value of the semaphore
A
0
B
8
C
10
D
12
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12