1
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Each process Pi,i=1.....9 is coded as follows

  Repeat
  P(mutex){
  critical section
  }
  V(mutex)
  Forever
The code for P10 is identical except that it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment?
A
1
B
2
C
3
D
None of the above
2
GATE CSE 1997
MCQ (Single Correct Answer)
+1
-0.3
Heap allocation is required for languages.
A
that support recursion
B
that support dynamic data structures
C
that use dynamic scope rules
D
None of the above
3
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6

Given the following Pascal like program segment:

Procedure A;

     x,y:intger;
     Procedure B;
            x,z:real;
            S1
     end B;
     Procedure C;
            i:integer;
            S2;
     end C;
end A;

The variables accessible in S1 and S2 are

A
x or A, y, x of B and z in S1 and x of B, y and i in S2
B
x or B, y and z in S1 and x of B, i and z in S2
C
x or B, z and y in S1 and x of A, i and y in S2
D
None of the above
4
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following is not decidable?
A
Given a Turing machine $$M,$$ a stings s and an integer $$k,$$ $$M$$ accepts $$s$$ within $$k$$ steps
B
Equivalence of two given Turing machines
C
Language accepted by a given finite state machine is not empty
D
Language generated by a context free grammar is non empty
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12