Recent activity by Arpit Dhuriya

9 answers
1
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid - 6$. The min-degree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, min-d...
2 answers
3
1 answer
5
3 answers
8
Do we consider hierarchical model or simultaneous access model for write through ?
3 answers
9
1 answer
11
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combi...
2 answers
12
Let $f(x)=\log|x|$ and $g(x) =\sin x$. If $A$ is the range of $f(g(x))$ and $B$ is the range of $g(f(x))$ then $A\cap B$ is$[-1,0]$$[-1,0)$$[-\infty ,0]$$[-\infty ,1]$
2 answers
16
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?I got 382.Is it correct?
3 answers
17
Is the above relation is dependency preserved or not
1 answer
18
R(ABCD)F={ A→B, B→C, C→D, D→A }Now Decompose this into D={ AB, BC, CD }Dependency is preserved or Not ?Source : http://www.gatecrack.in/following-decomposition-d...
1 answer
20
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. PQRSTUVWWeight1812161416201015Profit341522161722...
1 answer
21
3 answers
24
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modi...
1 answer
25
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
2 answers
28
If G is an infinite cyclic group then which of the following is not true?a) G has exactly 2 generators.b) G is isomorphic to (Z,+).c) Every proper sub group of G is fini...
1 answer
29
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?