Computer Sciences > Gate 2016 Set-1 > Functions
A function f : N+ → N+, defined on the set of positive integers N+, satisfies the following
properties:
f(n) = f(n/2) if nis even
f(n) = f(n+5) if nis odd
Let R = {i|∃ j : f(j) = i} be the set of distinct values that f takes. The maximum possible size of R is .
properties:
f(n) = f(n/2) if nis even
f(n) = f(n+5) if nis odd
Let R = {i|∃ j : f(j) = i} be the set of distinct values that f takes. The maximum possible size of R is .
Explanation
Correct : a
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.