Home / MCQ Bank / Computer
Computer Miscellaneous On Data Structures Difficulty: Medium

Solve the following recurrence using Master's theorem. T(n) = 0.7 T (n/2) + 1/n

Select the correct option to test your answer:

More Computer Questions

What kind of memory is both static and non -volatile? Which of the following(s) can be used to access the last element of a vector v? What is the output of the given code? array1 = [[1,2,3,4],[0,0,0,0]] array2 = [[1,2,3,4],[0,0,0,0]] print array1-array2 The topology with highest reliability is: What will be the output of the following C code? #include <stdio.h> void main() { int x = 3; { x = 4; printf("%d", x); } }