1
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:
2
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.
3
GATE CSE 1996
MCQ (Single Correct Answer)
+1
-0.3
A ROM is sued to store the table for multiplication of two $$8$$-bit unsigned integers. The size of ROM required is
A
$$256 \times 16$$
B
$$64\,K \times 8$$
C
$$4\,K \times 16$$
D
$$64\,K \times 16$$
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
A $$1000$$ Kbyte memory is managed using variable partitions but to compaction. It currently has two partitions of sizes $$200$$ Kbytes and $$260$$ Kbytes respectively. The smallest allocation request in Kbytes that could be denied is for
A
$$151$$
B
$$181$$
C
$$231$$
D
$$541$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12