0 votes
1
2 votes
2
Ethernet frame may carry data upto 512 byte (i.e. mtu 512B ).If total number of fragments are denoted by x and payload bytes in last fragment is y then value of y*2x will...
1 votes
5
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
7 votes
9
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } }time complexity.?a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ ...
3 votes
11
A particular parallel program computation requires 100 ns when executed on a single processor. If 20 percent of this computation is sequential then the execution time for...
0 votes
12
1 votes
13
1 votes
15
Hsh tables can contribute to an efficient average case solution for all of the following problems described below except?a. Counting Distinct Valuesb. Dynamic Dictionaryc...
0 votes
16
Assume $P \neq NP$. Which of the following is not TRUE?$2$-SAT in NP$2$-SAT in coNP$3$-SAT is polynmial-time reducible to $2$-SAT4-SAT is polynmial-time reducible to $3$-...
0 votes
18
2 votes
19
Q. The minimal function that can detect a 'divisible by 3' 8421 BCD code digit(representation is D8 D4 D2 D1 ) is given by
0 votes
21
Whether the given language is context free or context sensitive?
1 votes
30
L = { ap | P is NOT Prime } - How to prove is it CFL or NOT?