GATE CS 2022 Set 1 — Question 51

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+2 / -0HardRecurrence RelationsSets & CombinatoricsEngineering Mathematics

Engineering Mathematics → Sets & Combinatorics → Recurrence Relations

Last updated

Question

Consider the following recurrence:f(1)=1;f(2n)=2f(n)1,for n1;f(2n+1)=2f(n)+1,for n1.\begin{aligned} f(1) &= 1; \\ f(2n) &= 2f(n) - 1, & \text{for } n \ge 1; \\ f(2n + 1) &= 2f(n) + 1, & \text{for } n \ge 1. \end{aligned}Then, which of the following statements is/are TRUE?
Your answer

Select all that apply, then check your answer.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans
PYQs with solutions
Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts
Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support
Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.

More questions on Sets & Combinatorics