1
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units respectively. The completion time of A under round robin scheduling with time slice of one time units.
A
$$10$$
B
$$4$$
C
$$8$$
D
$$9$$
2
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
A critical section is a program segment
A
Which should run in certain specified amount of time
B
Which avoids deadlocks
C
Where shared resources are accessed
D
Which must be enclosed by a pair of semaphore operations, P and V
3
GATE CSE 1996
Subjective
+2
-0
The concurrent programming constructs fork and join are as below: Fork (label) which creates a new process executing from the specified label join (variable) which decrements the specified synchronization variable (by 1) and terminates the process if the new value is not 0. Show the precedence graph for S1, S2, S3, S4 and S5 of the concurrent program below.
N = 2
M = 2
fork L3
fork L4
S1
L1 : join N
S3
L2: join M
S5
L3:S2
goto L1
L4:S4
goto L2
next:
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A solution to the Dining Philosophers Problem which avoids deadlock is
A
ensure that all philosophers pick up the left fork before the right fork.
B
ensure that all philosophers pick up the right fork before the left fork
C
ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork
D
None of the above.
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12