Dark Mode

Recent questions tagged recursion

2 votes

1 answer

1

GATE CSE 2023 | Question: 26
Consider the following program: int main() int f1() int f2(int X) int f3() { { { { f1(); return(1); f3(); return(5); f2(2); } if(X==1) } f3(); return f1(); return(0); else } return (X*f2(X-1)); } Which one of the following options represents the activation tree corresponding to the main function?

admin asked in Programming Feb 15

by admin

1.1k views

0 votes

1 answer

2

Ace Test series |C programming | What will be the output of the following program ?
What will be the output of the following program ? answer is 8 but I am getting 5, please explain where I am wrong

abhinowKatore asked in Programming Jan 18

by abhinowKatore

225 views

0 votes

3 answers

3

Self Doubt
A recursion program without a terminating condition will provide infinite output. True/False?

Aryanzzzz asked in Algorithms Jan 16

136 views

0 votes

0 answers

4

C programming
What will be the return value of the below function, if it is called a sample(4)? int sample(int x){ if( x == 0 || x ==2) return 1; return (sample(--x) * (x--)); }

abhinowKatore asked in Programming Dec 5, 2022

by abhinowKatore

262 views

0 votes

0 answers

5

Best Open Video Playlist for Recursion Topic | Programming
Please list out the best free available video playlist for Recursion from programming as an answer here (only one playlist per answer). We'll then select the best playlist and add to GO classroom video lists. You can add any ... but standard ones are more likely to be selected as best. For the full list of selected videos please see here

makhdoom ghaya asked in Study Resources Aug 16, 2022

by makhdoom ghaya

118 views

1 vote

1 answer

6

Recursion
#include <stdio.h> int fun(int num){ while(num>0) { num=num*fun(num-1); } return num; } int main() { int x=fun(8); printf("%d",x); return 0; } Hello Folks, I have a doubt related to the above snippet of code. Why does the output of the above code be 0? Kindly help me with a detailed explanation.

ryandany07 asked in Programming Aug 15, 2022

274 views

3 votes

3 answers

7

GO Classes Scholarship 2023 | Test | Question: 17
Consider the following pair of mutually recursive functions. int f(int n){ if (n==0) return 1; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) - f(n); } Which of the following is/are will evaluate to TRUE? $f(2) == g(0)$ $g(2)+f(1) == 0$ $g(4)+g(1) == 0$ $f(3)+f(0) == 0$

GO Classes asked in Programming Aug 7, 2022

367 views

2 votes

3 answers

8

GO Classes Scholarship 2023 | Test | Question: 27
What will be the number of recursive calls for $\textsf{mystery(5)}$ including the first call? void mystery(int n) { if (n == 0 || n == 1) return 0; mystery(n-2); printf("%d", n); mystery(n-1); }

GO Classes asked in Programming Aug 7, 2022

280 views

3 votes

1 answer

9

GO Classes Scholarship 2023 | Test | Question: 28
What will be the output of the following program? #include<stdio.h> struct _go{ char b[20]; char *a; struct _go *c; }x[2] = {"GATE", "2023", x+1, "GO", "Classes", x}, *p = x; typedef struct_go go; go ... ;c, n-2); } int main() { printf("%s",mystry(p,2023)->a); } GATE $2023$ Run time error GO

GO Classes asked in Programming Aug 7, 2022

323 views

0 votes

1 answer

10

Recursive function
Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1} Assume for every function call T(i) it checks the table first , if it's value is already ... value of 'n' so that overflow cannot occur . ( Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)

Manisha Jaishwal asked in Programming Aug 6, 2022

by Manisha Jaishwal

258 views

1 vote

3 answers

11

Which value of static variable is returned if it is present in return statement of a recursive function?

jverma asked in Programming May 23, 2022

by jverma

603 views

Page:

1
2
3
4
5
6
7
next »

Recent questions tagged recursion