Register
Filter

Answers by Habibkhan

2 votes
421
Calicut Gate Academy Test Series | DAA Find Complexity
Complexity of the below code snippet is .. for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } } $O(nlog n)$ $O(n^{2})$ $O(nloglog n)$ $O(n)$
Complexity of the below code snippet is ..for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } }$O(nlog n)$$O(n^{2})$$O(nloglog n)$$O(n)$
2 votes
422
Computer networks
What is RTT in Computer networks? A)Transmission delay + 2*propogation delay B)2*propogation delay.
What is RTT in Computer networks?A)Transmission delay + 2*propogation delayB)2*propogation delay.
21 votes
424
How to Check For Partial Decidability
What is Partial Decidability ? How do we check whether a problem is Partialy Decidable or Not ?
What is Partial Decidability ? How do we check whether a problem is Partialy Decidable or Not ?
2 votes
425
MadeEasy Test Series: Algorithms - Asymptotic Notations
what if i take f(x) = sinx, g(x)= cosx? these two cant be compared. sinx cant be written as O(cosx) and also cosx cant be written as O(sinx) then B becomes invalid. plz verify
what if i take f(x) = sinx,g(x)= cosx?these two cant be compared.sinx cant be written as O(cosx) and also cosx cant be written as O(sinx)then B becomes invalid.plz verify...
2 votes
426
Asymptotic Notations DAA
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$ Arrange Them in Increasing Order of rate of growth
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$Arrange Them in Increasing Order of rate of growth
2 votes
427
Speedup due to Pipelining
1 votes
430
Calicut Gate Academy Test Series | TOC
L={ambnckdl | (n-k ) is odd only if (m-l) is odd , m,n,k,l >=0 } is best fit under which language class RL DCFL CFL CSL
L={ambnckdl | (n-k ) is odd only if (m-l) is odd , m,n,k,l >=0 } is best fit under which language classRLDCFLCFLCSL
2 votes
431
MadeEasy Test Series: Digital Logic - Boolean Expressions
my doubt is here we find that redundant expression ??? but answer is given non redundant expression?? plz check
my doubt is here we find that redundant expression ??? but answer is given non redundant expression?? plz check
0 votes
433
distribution
How many ways are there to distribute 5 balls into 3 boxes if: the balls are unlabeled but the boxes are labeled.
How many ways are there to distribute 5 balls into 3 boxes if:the balls are unlabeled but the boxes are labeled.
3 votes
436
L = {an bam|n,m ≥ 0 and n = m mod 5} is regular
L = {an bam|n,m ≥ 0 and n = m mod 5} is regular
L = {an bam|n,m ≥ 0 and n = m mod 5} is regular
0 votes
438
ACE TEST GOS-2 Q1
correct answer?
correct answer?
4 votes
439
Function
Which of the following statement/s representing One-to-One Function. S1; ∀a∀b(f (a) = f (b) → a = b) S2: ∀a∀b( a ≠ b→f (a) ≠ f (b) ) S3: ∀a∀b(a = b → f (a) = f (b)), S4: ∀a∀b(f (a) ≠ f (b) → a ≠ b)
Which of the following statement/s representing One-to-One Function.S1; ∀a∀b(f (a) = f (b) → a = b)S2: ∀a∀b( a ≠ b→f (a) ≠ f (b) )S3: ∀a∀b(a = b →...
2 votes
440
2 bulbs out of a sample of 10 bulbs manufactured by a company are defective.
2 bulbs out of a sample of 10 bulbs manufactured by a company are defective. The probability that 3 out of 4 bulbs bought by a customer will not be defective is
2 bulbs out of a sample of 10 bulbs manufactured by a company are defective. The probability that 3 out of 4 bulbs bought by a customer will not be defective is
11 votes
441
digital logic
The lowest frequency in kHz, if a 6 MHz clock frequency is applied to a cascaded counter of modulus 2 counter and modulus 3 counter are ________. is it correct ?
The lowest frequency in kHz, if a 6 MHz clock frequency is applied to a cascaded counter of modulus 2 counter and modulus 3 counter are ________.is it correct ?
3 votes
442
ME -- Hashing
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new element fits without collision? I think it should be $\frac{5}{11}$ but answer given says ::: EDIT :: Actual question is
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new...
Page: