Register

Recent questions tagged made-easy-test-series

1 votes
1 answer
1574
#made easy
Big oh estimate for f(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as 1.O(xlogx) 2.O($x^2$) 3.O($x^3$) 4O($x^2$logx)
Big oh estimate forf(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as1.O(xlogx)2.O($x^2$)3.O($x^3$)4O($x^2$logx)
User Avatar
1 votes
1 answer
1575
#made easy
soluation for the recurrence relation is f(x)=2T(floor(rootn))+logn 1.O(nlogloglogn) 2.O(nloglogn) 3.O(loglogn) 4O(lognloglogn)
soluation for the recurrence relation isf(x)=2T(floor(rootn))+logn1.O(nlogloglogn)2.O(nloglogn)3.O(loglogn)4O(lognloglogn)
User Avatar
2 votes
1 answer
1576
made easy
which is true about huffman coding- 1.Huffman coding may become loss in some time 2.in Huffman coding no code is prefix of any other code 3.huffman code may not be optimal lossless code in some case 4.all of above
which is true about huffman coding-1.Huffman coding may become loss in some time2.in Huffman coding no code is prefix of any other code3.huffman code may not be optimal l...
User Avatar
Page: