Register
Filter

Recent activity by diabolicfreak

10 answers
2
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
5 answers
3
ISRO2017-51
Wha is the output of the following program? main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); } 10 and 11 10 11 11 and 11
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
2 answers
7
Difference between deadloack & spinlock
2 answers
8
entity relationship
2 answers
9
A n variable function can be realized with ________ select line multiplexer
A n variable function can be realized with _______ select line multiplexer (A) n (B) n-1 (C) both (D) none of these
A n variable function can be realized with _______ select line multiplexer(A) n(B) n-1(C) both(D) none of these
1 answer
10
CN Maximum sender window Size
In every sliding window protocol,the maximum sender window size is the number of frames that can be transferred by sender in RTT? Is this statement true?
In every sliding window protocol,the maximum sender window size is the number of frames that can be transferred by sender in RTT?Is this statement true?