GATE CS 2018 Set 1 — Question 55
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0HardFunctions & RecursionC ProgrammingProgramming & Data Structures
Programming & Data Structures → C Programming → Functions & Recursion
Last updated
Question
Consider the following program written in pseudo-code. Assume that and are integers.The number of times that the
Count(x,y) {
if (y != 1){
if (x != 1) {
print("*");
Count(x/2, y);
}
else {
y = y-1;
Count(1024, y);
}
}
}
print statement is executed by the call Count(1024,1024) is _____.Correct answer
10230 to 10230
Solution
The function
.
The
This results in exactly 10 prints for each valid value of .
Total prints = (Number of iterations) (Prints per iteration)
Total prints = .
Count(x, y) is a recursive function that prints a '*' based on the values of and .1.Inner Loop (Recursion on ): For a fixed value of (where ), the function prints a '*' and calls itself with as long as .
Starting with , the sequence of values is:.
The
print statement is executed for .This results in exactly 10 prints for each valid value of .
2.Outer Loop (Recursion on ): When reaches 1, the
else block is executed:- is decremented:
- The function is called again with the reset value of :
Count(1024, y-1)
if (y != 1) holds true.3.Total Iterations:
- The initial call is
Count(1024, 1024). - The values of for which the inner logic (and thus the prints) occurs are .
- When , after the recursion finishes and , becomes . The call
Count(1024, 1)is made, the conditionif (1 != 1)fails, and the program terminates. - The number of values is .
Total prints = (Number of iterations) (Prints per iteration)
Total prints = .
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 C Programming
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]