Register

Recent questions tagged mit-quiz

0 votes
1 answer
1
MIT assignment
Find the complexity of the following code fragment: int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
Find the complexity of the following code fragment:int i = 1; for(; i <= n logn; i++) { for(i++; i <= n; i++) { printf("1") } }
User Avatar
1 votes
2 answers
2
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k = 1 ; k <= j ; k++) { x=x+10; } }
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
User Avatar
0 votes
2 answers
3
MIT ASSIGNMENT
FIND THE TIME COMPLEXITY int i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
User Avatar
1 votes
1 answer
4
MIT_algorithms
I don't understand How?
I don't understand How?
User Avatar
1 votes
1 answer
5
MIT assignment Doubt
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf:- explain ?
How the worst case of merge sort is O(n^2) according to the given MIT assignment pdf:-explain ?
User Avatar
2 votes
3 answers
6
MIT Course
For each group of functions, sort the functions in increasing order of asymptotic (big-O) complexity: ... its an exponential function, but since the power is to 1.000001, it is growing very slowly, since base is tending to 1 only. Someone please check this.
For each group of functions, sort the functions in increasing order of asymptotic (big-O) complexity:$\begin{align*} &(a) \;\;f1(n) = n^{0.999999} * \log n \\ &(b) \;\;f2...
User Avatar
1 votes
1 answer
7
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
User Avatar
1 votes
1 answer
8
MIT QUIZ
User Avatar
To see more, click for the full list of questions or popular tags.