Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?

Select an option to check

Key concept

Recursion

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Recursion

GATE tests Recursion primarily through direct execution tracing of recursive C code snippets, stack-unwinding behavior (pre-order vs. post-order execution), and termination/infinite recursion analysis. Questions frequently incorporate static variables, pointer/reference aliasing, mutual recursion, and tree/array traversals to test whether candidates can systematically maintain call frames. In recent years, the focus has expanded from standard tracing to higher-order mathematical characterizations (e.g., finding the smallest input or maximum output value of composed recurrences).

Full Recursion guide →

More on Recursion

All 19 questions on Recursion →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Programming and Data Structures · Recursion

Official IIT answer key · IIT Kanpur · Audited Aug 2026

Take topic test

GATE CSE 2015 Set 3 Q39 · MCQ · 2 marks

Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?

Select an option to check

Key concept

Recursion

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Recursion

Full Recursion guide →

More on Recursion

All 19 questions on Recursion →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2015 Set 3

More on Recursion

Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2015 Set 3

More on Recursion

Consider the following recursive C function. void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); } If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2015 Set 3

More on Recursion

Share this solution

Consider the following recursive C function. void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); } If get(6) function is being called in main() then how many times will the get() function be invoked before returning to the main()?

Step-by-step verified solution

Check you can still solve Recursion under a clock

More from GATE CSE 2015 Set 3

More on Recursion

Share this solution

Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?

Consider the following recursive C function. `void get(int n) { if (n<1) return; get(n-1); get(n-3); printf("%d", n); }` If `get(6)` function is being called in `main()` then how many times will the `get()` function be invoked before returning to the `main()`?