Computer Sciences > Gate 2022 > 1
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?
A
f(2n–1)=2n–1
B
f(2n)=1
C
f(5⋅2n)=2n+1+1
D
f(2n+1)=2n+1

Correct : a,b,c

Similar Questions

Consider the following languages: L1 = {ww | w ∈ {a, b}* } L2 = {anbncn | m, n≥ 0} L3 = {ambncn | m, n≥ 0} Which of the following statements is/are FALSE?
#322 MSQ
Consider the following languages: L1 = {ww | w ∈ {a, b}* } L2 = {anbncn | m, n≥ 0} L3 = {ambncn | m, n≥ 0} Which of the following statements is/are FALSE?
#322 MSQ
Consider the following languages: L1 = {ww | w ∈ {a, b}* } L2 = {anbncn | m, n≥ 0} L3 = {ambncn | m, n≥ 0} Which of the following statements is/are FALSE?
#322 MSQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......