Register
Webpage for Algorithms

Recent questions tagged algorithms

0 votes
1 answer
122
function call
int foo(int n){ if(n<3) return 1; else return (foo(n-1) + foo(n-3) + 1); } Let ‘m’ denote the number of invocations of function foo and ‘n’ denote the return value when the function is called as foo(foo(5)). What is the value of m - n ?
int foo(int n){if(n<3)return 1;else return (foo(n-1) + foo(n-3) + 1);}Let ‘m’ denote the number of invocations of function foo and ‘n’ denote the return val...
User Avatar
1 votes
1 answer
124
consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message
consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message
User Avatar
0 votes
1 answer
125
Recurrence relations
Consider the following function: function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); } Find the worst case time complexity of function X ?
Consider the following function:function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); }Find the worst case time complexity of function...
User Avatar
0 votes
1 answer
128
number of min MSTs
User Avatar
1 votes
1 answer
129
test series
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } } What will be the time complexity of the above code?
int i,j,k,s=0; for(i=1; i<=n; i++) { for(j=1 ; j<=i; j=j*2) { for(k=n; k>1;k=k/2) { s++; } } }What will be the time complexity of the above code?
User Avatar
0 votes
0 answers
130
Algorithm
User Avatar
0 votes
0 answers
131
Algorithm
User Avatar
0 votes
0 answers
132
Algorithm
User Avatar
0 votes
0 answers
133
Made Easy Workbook
User Avatar
0 votes
1 answer
135
unacademy
int fun1( int n ) { int i , j , p =0, q =0; for( i =1 ; i < n ; ++i) { for( j =n ; j > 1; j = j/2) ++p; for( k =n ; k > p; k = k*2) ++q; } return q; }
int fun1( int n ){ int i , j , p =0, q =0; for( i =1 ; i < n ; ++i) { for( j =n ; j 1; j = j/2) ++p; for( k =n ; k p; k ...
User Avatar
0 votes
1 answer
136
Algorithm
Answer ????
Answer ????
User Avatar
0 votes
0 answers
138
Made easy test series
what they want to tell and it is true or false?
what they want to tell and it is true or false?
User Avatar
0 votes
1 answer
139
Made Easy Test Series 2024
How many times is the comparison $i >= n$ performed in the following program? int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }
How many times is the comparison $i >= n$ performed in the following program?int i = 200 n = 80; main() { while (i >= n) { i = i - 2 n = n + 1 } }
User Avatar
0 votes
1 answer
142
Made Easy Test Series 2024
Numerical Answer Type Que? (please Try to give some ahortcut trick also or important concept is there to solve that question )
Numerical Answer Type Que?(please Try to give some ahortcut trick also or important concept is there to solve that question )
User Avatar
Page: