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)
+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$$
3
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$$
4
GATE CSE 1996
Subjective
+5
-0
A demand paged virtual memory system uses $$16$$ bit virtual address, page size of $$256$$ bytes, and has $$1$$ Kbyte of main memory. $$LRU$$ page replacement is implemented using a list, whose current status (page numbers in decimal ) is GATE CSE 1996 Operating Systems - Memory Management Question 22 English
$$\eqalign{ & \,\, \uparrow \cr & LRU\,Page \cr} $$
For each hexa decimal address in the address sequence given below,
$$00FF,$$ $$010D,$$ $$10FF,$$ $$11B0$$
Indicate,
i) The new status of the list
ii) Page faults, if any, and
iii) Page replacements, if any
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12