[go: up one dir, main page]

0% found this document useful (0 votes)
91 views5 pages

2) Fibonacci Series Program in C Using Recursion: 1) Calculate Area and Circumference of A Circle Using Functions

The document contains code snippets for several C programs that demonstrate functions: 1) A program to calculate the area and circumference of a circle using functions. 2) A Fibonacci series program using recursion. 3) A program to display a multiplication table using a function. 4) Two programs to check if a number is prime using different loops. 5) A program to find the sum of digits in a number using recursion.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
91 views5 pages

2) Fibonacci Series Program in C Using Recursion: 1) Calculate Area and Circumference of A Circle Using Functions

The document contains code snippets for several C programs that demonstrate functions: 1) A program to calculate the area and circumference of a circle using functions. 2) A Fibonacci series program using recursion. 3) A program to display a multiplication table using a function. 4) Two programs to check if a number is prime using different loops. 5) A program to find the sum of digits in a number using recursion.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

1) Calculate area and circumference of a circle using functions

#include <stdio.h>

const float PI = 3.1415927;

float area(float radius);

float circum(float radius);

void main()

float radius;

clrscr();

printf("Enter radius: ");

scanf("%f", &radius);

printf("Area : %.3f\n", area(radius));

printf("Circumference: %.3f\n", circum(radius));

getch();

float area(float radius)

return PI * radius * radius;

float circum(float radius)

return 2 * PI * radius;

2) Fibonacci series program in c using recursion


#include<stdio.h>

int Fibonacci(int);

main()

int n, i = 0, c;

scanf("%d",&n);

printf("Fibonacci series\n");

for ( c = 1 ; c <= n ; c++ )

printf("%d\n", Fibonacci(i));

i++;

return 0;

int Fibonacci(int n)

if ( n == 0 )

return 0;

else if ( n == 1 )

return 1;

else

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

Display Multiplication Table using Functions in C Programming

#include<stdio.h>

void multiplication_table(int num, int limit)


{

int count;

for(count = 1; count <= limit; count++)

printf("%d X %d = %d\n", num, count, (num*count));

int main()

int num, limit;

printf("\nEnter a Number:\t");

scanf("%d", &num);

printf("\nEnter the Limit:\t");

scanf("%d", &limit);

multiplication_table(num, limit);

return 0;

Program to Check Prime Number

#include <stdio.h>

int main()

int n, i, flag = 0;

printf("Enter a positive integer: ");

scanf("%d",&n);

for(i=2; i<=n/2; ++i)

if(n%i==0)

flag=1;

break;
}

if (flag==0)

printf("%d is a prime number.",n);

else

printf("%d is not a prime number.",n);

return 0;

C Program To Check Prime Numbers using While Loop

#include <stdio.h>

int main()

int num, count = 2, temp = 0;

printf("\nEnter a Number:\t");

scanf("%d", &num);

while(count <= num - 1)

if(num%count == 0)

temp = 1;

break;

count++;

if(temp == 0)

printf("\n%d is a Prime Number\n", num);

else

{
printf("\n%d is Not a Prime Number\n", num);

return 0;

C Program To Find Sum of Digits of Number using Recursion

#include<stdio.h>

int sum(int x);

int main()

int res, num;

printf("\nEnter a Number:\t");

scanf("%d", &num);

res = sum(num);

printf("\nSum of Digits : \t%d\n", res);

return 0;

int sum(int x)

if(x == 0)

return x;

else

return (x%10 + sum(x/10));

You might also like