GATE CSE
A. All pairs shortest path | 1. Greedy |
B. Quick Sort | 2. Depth-First Search |
C. Minimum weight spanning tree | 3. Dynamic Programming |
D. Connected Components | 4. Divide and Conquer |
Which of the following statements is true?
In the following grammar:
$$\eqalign{ & X:: = X \oplus {Y \over Y} \cr & Y:: = Z*{Y \over Z} \cr & Z:: = id \cr} $$Which of the following is true?

$$a \to c\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,b \to d$$
This relation is
(a) Insert into $$R$$ (b) Insert into $$S$$
(c) Delete from $$R$$ (d) Delete from $$S$
Which of the following statements is true about the referential integrity constraint above?
The value of the radix' $$r$$ is:

$${f_1}\left( {w,\,x,\,y,\,z} \right) = \sum {8,9,10} $$
$${f_2}\left( {w,\,x,\,y,\,z} \right) = \sum {7,8,12,13,18,15} $$
$$f\left( {w,\,x,\,y,\,z} \right) = \sum {\left( {8,9} \right)} $$
The function $${f_3}$$ is
$$f\left( x \right) = 2{x^2} - 2x + 6$$ in the interval $$\left[ {0,2} \right]$$?
$$\,\,\,\,\,$$ List - $${\rm I}$$
(a) $$DMA$$ $$\,\,$$ $${\rm I}/O$$
(b) Cache
(c) Interrupt $${\rm I}/O$$
(d) Condition Code Register
$$\,\,\,\,\,$$ List - $${\rm II}$$
(1) High speed $$RAM$$
(2) Disk
(3) Printer
(4) $$ALU$$
(a) Disk scheduling $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$(1) Round robin
(b) Batch processing $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ (2) $$SCAN$$
(c) Time sharing $$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ (3) $$LIFO$$
(d) Interrupt processing $$\,\,\,\,\,\,\,\,\,\,\,$$(4) $$FIFO$$
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? 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