recursions

 1. Srujan asks his son Arun to calculate the sum of total natural numbers present on the board. 

Arun starts summing the natural numbers and after reaching up to 10 he gets confused and 

again starts counting from first. Your task is to help Arun to calculate the sum of n natural 

numbers recursively

Sol: 

 #include<stdio.h>

 int sum(int n);

 int main()

 {

 int n;

 scanf("%d",&n);

 printf("sum of natural numbers=%d\t",sum(n));

 return 0;

 }

 int sum(int n)

 {

 if(n==0)

 {

return 0;

 }

 else if(n==1)

 {

 return 1;

 }

 else

{

return (n+sum(n-1));

}

}

2.Write a recursive module to find factorial of a given number.

Sol:

 #include<stdio.h>

 long int fact(int n);

 int main()

 {

 int n;

 scanf("%d",&n);

 printf("factorial of a given number=%ld",fact(n));

 return 0;

 }

 long int fact(n)

 {

if(n==0||n==1)

 {

return 1;

 }

 else

 {

return(n*fact(n-1));

 }

 }

3.Two kids are playing with each other. Game is one must give any integer number and the other 

must count the number of digits that number contains. Your task is to develop a program to 

count the digits of a number using recursion

4. Write a program in C to count the digits of a given number using recursion. Example: Input a 

number : 50 Expected Output : The number of digits in the number is : 2

Sol : 

 #include<stdio.h>

int countdigit(int n);

int main()

{

int n;

scanf("%d",&n);

printf("digits count=%d",countdigit(n));

return 0;

}

int countdigit(int n)

{

static int count=0;

if(n>0)

{

count++;

countdigit(n/10);

}

else

{

return count;

}

}

5. In mathematics, finding the GCD of a number is quite interesting. Hari is a genius in programming, 

he wants to find the GCD of a number using his programming skills. Your task is to help Hari in 

getting GCD of a number recursively with possible test cases.

Sol:

#include<stdio.h>

int gcd(int a,int b);

int main()

{

int a,b;

scanf("%d%d",&a,&b);

printf("\n the gcd of given number=%d",gcd(a,b));

return 0;

}

int gcd(int a,int b)

{

if(b!=0)

{

return(gcd(b,a%b));

}

else

{

return a;

}

}

6. Write a C program to print Fibonacci series using recursive function

Sol:

 #include<stdio.h>

 int fib(int n);

 int main()

 {

 int n,i;

 scanf(“%d”,&n);

 for(i=0;i<n;i++)

 {

 printf(“%d\t”,fib(i));

 } 

 return 0;

 }

 int fib(int n)

 {

 if(n==0)

 return 0;

 else if(n==1)

 return 1;

 else

 return (fib(n-1)+fib(n-2));

 } 

Comments

Post a Comment

Popular posts from this blog

1d array

 1. A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the  left. For example, if 2 left rotations are performed on array [1,2,3,4,5], then the array would  become [3,4,5,1,2]. Given an array of n integers and a number, d, perform d left rotations on  the array. Then print the updated array as a single line of spaceseparated integers. Sol: #include<stdio.h> int main() {  int i,s,j,t;  long long int n;  scanf("%lld",&n);  int a[n];  scanf("%d",&s);  for(i=0;i<n;i++)  {  scanf("%d",&a[i]);  }  for(j=1;j<=s;j++)  {  t=a[0];  for(i=0;i<=n-1;i++)  {  a[i]=a[i+1];  }  a[n-1]=t;  }  for(i=0;i<n;i++)  {  printf("%d ",a[i]);  }  return 0; } 2. Develop a program to accept the age of n students of class, rearrange the data in ascending  order and display the age of youngest and eldest stu...
Read more

strings

 /* 1. You have been given a String S. You need to find and print whether this string is a  palindrome or not. If yes, print"YES" (without quotes), else print "NO" (without quotes) */ #include <stdio.h> #include <string.h> int main()  { int h,l=0,count=0; char ch[100]; scanf("%s", ch); h=(strlen(ch)-1); while(h>l){  if(ch[l++]!=ch[h--]){  count++;  }  } if(count>0){  printf("NO"); } else{  printf("YES"); }  return 0; } /* 2. Alice wrote a sequence of words in CamelCase as a string of letters, s, having the  following properties: It is a concatenation of one or more words consisting of English  letters., All letters in the first word are lowercase., For each of the subsequent words, the  first letter is uppercase and rest of the letters are lowercase. Given s, print the number of  words in s on a new line.Sample Input: saveChangesInTheEditor Sample Output: 5 */ #include<stdio.h> int main() { ...
Read more

2d array

1. Given two matrices of order M1*N1 and M2*N2. Write function to perform matrix multiplication and display the resultant matrix if matrix multiplication is possible otherwise display the message "Invalid Matrices".  Sol: #include int main()  {  i nt m, n, p, q, c, d, k, sum = 0;   int first[10][10], second[10][10], z[10][10];  printf("\nEnter the number of rows and columns of first matrix:\n");   scanf("%d%d", &m, &n);   printf("\nEnter the number of rows and columns of second matrix:\n");   scanf("%d%d", &p, &q);  if ( n != p )  {  printf("\nMatrices with entered orders can't be multiplied with each other.\n");   printf("\nThe column of first matrix should be equal to row of second.\n");   }  else   {   printf("\nEnter the elements of first matrix:\n");   for ( c = 0 ; c < m ; c++ )   for ( d = 0 ; d < n ; d++ )  scanf...
Read more