Recent questions tagged gatecse-2005

0 votes
1 answer
3
The time complexity of computing the transitive closure of binary relation on set of n element is known to be:-
31 votes
2 answers
4
53 votes
5 answers
15
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } }The space complexity of the a...
39 votes
3 answers
19
The following table has two attributes $A$ and $C$ where $A$ is the primary key and $C$ is the foreign key referencing $A$ with on-delete cascade.$$\begin{array}{|c|c|} \...
77 votes
8 answers
21
Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is:$94$$416$$464$$...
24 votes
3 answers
27
27 votes
1 answer
28
26 votes
3 answers
30
Consider the following circuit:The flip-flops are positive edge triggered $D$ $\textsf{FF}$s. Each state is designated as a two-bit string $Q_0Q_1$. Let the initial state...