342 views
–1 votes
–1 votes

j= n∗(1+1/2+1/2^2+1/2^3+..........1/2^k) how to solve this?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
srestha asked May 19, 2019
650 views
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
1 votes
1 votes
2 answers
2
srestha asked May 10, 2019
924 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
1 votes
1 votes
1 answer
3
VikramRB asked Jan 20, 2019
1,076 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$
1 votes
1 votes
1 answer
4
Mayankprakash asked Jan 4, 2019
1,371 views
T(n) = T(n/4) + T(3n/4) + nHow to solve these type of problems?Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +XCAN WE SOLVE LIKE T...