Register
Filter

Questions by vijaycs

0 votes
0 answers
1
Made-Easy | Synchronization
How option B would confirm - Bounded waiting.??
How option B would confirm - Bounded waiting.??
4 votes
3 answers
5
Gate cse facebook group doubt
What is the time complexity of the following code snippet? sum=0; for(i=0;i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=0;k<=n;k++) { sum=sum+k; } } } }
What is the time complexity of the following code snippet?sum=0; for(i=0;i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=0;k<=n;k++) { sum=sum+k; } } } }
6 votes
1 answer
7
Synchronization | Self-Doubt
1. Does starvation freedom imply bounded- waiting ? 2. Does bounded- waiting imply starvation freedom ? Explain with example.
1. Does starvation freedom imply bounded- waiting ?2. Does bounded- waiting imply starvation freedom ?Explain with example.
5 votes
1 answer
9
Maximum And Minimun
There are n distinct numbers are given not in sorted order. How much time it will take to select a number say k which is neither k-th minimum nor k-th maximum. A. O$(n)$ B. O$(1)$ C. O$(k)$ D. O$(k\log k)$.
There are n distinct numbers are given not in sorted order. How much time it will take to select a number say k which is neither k-th minimum nor k-th maximum.A. O$(n)$B....
1 votes
2 answers
10
Propositional Logic | Self doubt
Please give one example of each following logic in english sentence - 1. ($\forall$xP(x) -> $\exists$xQ(x)) == $\exists$x(P(x) -> Q(x)) 2. ($\exists$xP(x) -> $\forall$xQ(x)) -> $\forall$x(P(x) -> Q(x)) 3. $\forall$x(P(x) -> R) -> ($\exists$xP(x) -> R)
Please give one example of each following logic in english sentence -1. ($\forall$xP(x) - $\exists$xQ(x)) == $\exists$x(P(x) - Q(x))2. ($\exists$xP(x) - $\forall$xQ(x)) ...
1 votes
1 answer
11
Number of ways to put N indistinct objects into M indistinct boxes 
1 votes
2 answers
12
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
On which of the following recurrence relation Masters theorem can not be applied ?A. T(n)= 2T(n/2) + n (log n).B. T(n) = T(n/2) + 1.C. T(n) = 8T(n/2) + (log n).D. T(n) = ...
2 votes
1 answer
14
Minimum number of nodes in a full binary tree with height 3?
1 votes
2 answers
15
B. Math. 2005
Let S = { (a1 , a2 , a3 ) | 0 $\leq$ ai $\leq$ 9 and a1 + a2 + a3 is divisible by 3}. Then the number of elements in S is 327 333 334 336
Let S = { (a1 , a2 , a3 ) | 0 $\leq$ ai $\leq$ 9 and a1 + a2 + a3 is divisible by 3}. Then the number of elements in S is 327333334336
0 votes
1 answer
16
B.Math. 2005
Let $0 < \theta < \pi$. The area of the triangle in the plane formed by the vertices $(-1,0), (1,0), (\cos\theta, \sin\theta)$ is not more than $1$ can be more than $1$ but not more than $2$ can be more than $2$ but not more than $\pi$ can be more than $\pi$ but not more than $2\pi$
Let $0 < \theta < \pi$.The area of the triangle in the plane formed by the vertices $(-1,0), (1,0), (\cos\theta, \sin\theta)$ is not more than $1$can be more than $1$ but...
0 votes
1 answer
17
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals 175000 225500 149500 124000
The sum of all integers from 1 to 1000 that are divisible by 2 or 5 but not divisible by 4 equals 175000225500149500124000
1 votes
1 answer
18
B.Stat. 2005
If $\sqrt{3}$ + 1 is a root of equation 3 x$^{3}$ + ax$^{2}$ + bx + 12 = 0 where a and b are rational numbers, then b is equal to -6 2 6 10
If $\sqrt{3}$ + 1 is a root of equation 3 x$^{3}$ + ax$^{2}$ + bx + 12 = 0 where a and b are rational numbers, then b is equal to -62610