GATE Computer Science (CS) 2022 Shift 1 Solved Paper
© examsiri.com
Question : 50 of 65
Marks:
+1,
-0
Consider the following recurrence:
f(1) = 1;
f(2n) = 2f(n) - 1, for n ≥ 1;
f(2n + 1) = 2f(n) + 1, for n ≥ 1.
Then, which of the following statements is/are TRUE?
f(1) = 1;
f(2n) = 2f(n) - 1, for n ≥ 1;
f(2n + 1) = 2f(n) + 1, for n ≥ 1.
Then, which of the following statements is/are TRUE?
Go to Question: