Register
Filter

Recent activity by Anjana5051

2 answers
2
Test Algorithms
What is the space complexity of the following code? $O(logn)$ $O(n)$ $O(nlogn)$ $O(1)$
What is the space complexity of the following code?$O(logn)$ $O(n)$$O(nlogn)$ $O(1)$
2 answers
4
gatebook
Q.1 int A(int n){ if(n==2) return 1; else{ for(int j=1;j<=n;j++) printf(" * "); return(A(√n)); } } Time complexity
Q.1 int A(int n){if(n==2) return 1;else{for(int j=1;j<=n;j++)printf(" * ");return(A(√n));}} Time complexity
3 answers
5
class test
m=1; for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)} What is the complexity of above algorithm? 1. O(n*m3) 2. O(n3) 3. O(3n) 4. O(3m)
m=1;for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)}What is the complexity of above algorithm?1. O(n*m3)2. O(n3)3. O(3n)...
2 answers
6
Time Complexity
1 answer
7
MIT_algorithms
I don't understand How?
I don't understand How?
1 answer
8
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 ?
3 answers
9
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...
2 answers
10
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++; } }
2 answers
11
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 ...
1 answer
12
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") } }
1 answer
14
Advance test algorithms
Is there Any short cut to do these questions fast ?
Is there Any short cut to do these questions fast ?
1 answer
15
MIT QUIZ
1 answer
16
MIT QUIZ
plz explain otherwise i ll memorize it..
plz explain otherwise i ll memorize it..
3 answers
18
Calculating number of tokens
Given solution: Please explain how the number of tokens are 11.
Given solution:Please explain how the number of tokens are 11.
2 answers
20
Complier Design Test 1.1
Ques. S --> Aa/bAc/dc A --> d Which of them is correct. Please provide detailed information. a) LALR(1) but not SLR(1) b) Both SLR(1) and LALR(1) c) Grammar is Ambiguous d) Neither SLR(1) NOR LALR(1)
Ques. S Aa/bAc/dc A dWhich of them is correct. Please provide detailed information.a) LALR(1) but not SLR(1)b) Both SLR(1) and LALR(1)c) Grammar is Ambiguo...
2 answers
22
VirtualGate-2018-I-19
Consider the grammar given S->AA A->aA / b How many entries will be blank in the GOTO table for SR(0) items? What is the meaning of SR(0) items?
Consider the grammar givenS->AAA->aA / bHow many entries will be blank in the GOTO table for SR(0) items?What is the meaning of SR(0) items?
1 answer
23
When to shift and when to reduce?
In the above grammar, 1. how to determine the precedence of the operator? 2. If there is shift and reduce conflict, in who's favor to resolve? 3. Why are we not reducing E-->E+E, instead we are shifting. But incase of E-->id, we are reducing.
In the above grammar,1. how to determine the precedence of the operator?2. If there is shift and reduce conflict, in who's favor to resolve?3. Why are we not reducing E >...
1 answer
24
LR(zero)
Options are as:- (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
Options are as:-(a) i and ii (b) i and iii(c) ii and iii (d) none of the above
1 answer
25
#compiler
2 answers
29
Compiler design
1 answer
30
Compiler