#CompilerDesign #made-easy-test-series

jay03 asked Nov 28, 2022

499 views

See all

Show 6 previous comments

Please log in or register to answer this question.

Related questions

0 votes

0 votes

1 answer

1

Nitesh_Yadav asked Jan 4, 2022

512 views

#Made Easy Test Series
Find the time complexity of the given program

Find the time complexity of the given program

512 views

Nitesh_Yadav asked Jan 4, 2022

0 votes

0 votes

1 answer

2

Nitesh_Yadav asked Dec 10, 2021

551 views

#Made easy
Let N stations share 40kbps of pure aloha channel. Frame size is 512 bits which are send at every 40 seconds. The maximum value of N is ____

Let N stations share 40kbps of pure aloha channel. Frame size is 512 bits which are send at every 40 seconds. The maximum value of N is ____

551 views

Nitesh_Yadav asked Dec 10, 2021

1 votes

1 votes

1 answer

3

Hira Thakur asked Aug 14, 2016

993 views

#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)

993 views

Hira Thakur asked Aug 14, 2016

1 votes

1 votes

1 answer

4

Hira Thakur asked Aug 14, 2016

342 views

#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)

342 views

Hira Thakur asked Aug 14, 2016