Open In App

GATE | GATE CS 1996 | Question 20

Last Updated : 31 Oct, 2017
Improve
Improve
Like Article
Like
Save
Share
Report
A critical section is a program segment

(A) which should run in a 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


Answer: (C)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post


Previous Article
Next Article

Similar Reads

GATE | GATE CS 1996 | Question 41
Which of the following macros can put a micro assembler into an infinite loop? (i) .MACRO M1 X .IF EQ, X ;if X=0 then M1 X + 1 .ENDC .IF NE X ;IF X≠0 then .WORD X ;address (X) is stored here .ENDC .ENDM (ii) .MACRO M2 X .IF EQ X M2 X .ENDC .IF NE, X .WORD X+1 .ENDC .ENDM (A) (ii) only (B) (i) only (C) Both (i) and (ii) (D) None of the above Answer:
1 min read
GATE | GATE CS 1996 | Question 42
The correct matching for the following pairs is A. Activation record 1. Linking loader B. Location counter 2. Garbage collection C. Reference counts 3. Subroutine call D. Address relocation 4. Assembler (A) A-3, B-4, C-1, D-2 (B) A-4, B-3, C-1, D-2 (C) A-4, B-3, C-2, D-1 (D) A-3, B-4, C-2, D-1 Answer: (D) Explanation: Quiz of this Question
1 min read
GATE | GATE CS 1996 | Question 43
A 1000 Kbyte memory is managed using variable partitions but no 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 Answer: (B) Explanation: Quiz of this QuestionPlease comment below if you find anything wro
1 min read
GATE | GATE CS 1996 | Question 44
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 pic
1 min read
GATE | GATE CS 1996 | Question 45
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 unit is (A) 10 (B) 4 (C) 8 (D) 9 Answer: (D) Explanation: Quiz of this QuestionPlease comment belo
1 min read
GATE | GATE CS 1996 | Question 1
Let A and B be sets and let Ac and Bc denote the complements of the sets A and B. The set (A−B) ∪ (B−A) ∪ (A∩B) is equal to a). A ∪ B b). Ac ∪ Bc c). A ∩ B d). Ac ∩ Bc (A) a (B) b (C) c (D) d Answer: (A) Explanation: Quiz of this Question
1 min read
GATE | GATE CS 1996 | Question 2
Let X= {2, 3, 6, 12, 24}, Let ≤ be the partial order defined by X ≤ Y if x divides y. Number of edges in the Hasse diagram of (X,≤) is (A) 3 (B) 4 (C) 9 (D) None of the above Answer: (B) Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above post
1 min read
GATE | GATE CS 1996 | Question 3
Suppose X and Y are sets and |X| and |Y| are their respective cardinalities. It is given that there are exactly 97 functions from X to Y. From this one can conclude that (A) |X|=1,|Y|=97 (B) |X|=97,|Y|=1 (C) |X|=97,|Y|=97 (D) None of the above Answer: (A) Explanation: Quiz of this QuestionPlease comment below if you find anything wrong in the above
1 min read
GATE | GATE CS 1996 | Question 4
Which of the following statement is false? (A) The set of rational numbers is an abelian group under addition (B) The set of integers in an abelian group under addition (C) The set of rational numbers form an abelian group under multiplication (D) The set of real numbers excluding zero is an abelian group under multiplication Answer: (C) Explanatio
1 min read
GATE | GATE CS 1996 | Question 5
Two dice are thrown simultaneously. The probability  that at least one of them will have 6 facing up is (A) 1/36 (B) 1/3 (C) 25/36 (D) 11/36 Answer: (D) Explanation: There can be two cases: Case 1: Exactly one dice has 6 facing up and other dice can have any number from 1,2,3,4,5 facing up. There will be 5*2=10 such occurrences. Case 2: Both of the
1 min read