PRACTICAL-2(A)

AIM: WAP TO FIND THE FACTORIAL OF A NO. USING ITERATION

PSEUDO CODE:
Read number
Fact = 1
i=1
WHILE i<=number
Fact=Fact*i
i=i+1
ENDWHILE
WRITE Fact

Source code:
#include <stdio.h>
int main()
{ int c, n, fact = 1;
printf("Enter a number to calculate its factorial\n");
scanf("%d", &n);
for (c = 1; c <= n; c++)
{fact = fact * c;
printf("Factorial of %d = %d\n", n, fact);
return 0;}
getch();}
OUTPUT:
 PRACTICAL-2(B)
AIM: WAP TO FIND THE FACTORIAL OF A NO. USING RECURSION
PSEUDO CODE:
Fact(n)
Begin
if n == 1 then
Return ;
else
Return n*Call Fact(n-1);
end if
End
Source code:
#include<stdio.h>
int factorial(int);
int count=0;
int main()
{ int num,result;
printf("enter the no. to find its factorial::");
count++;
scanf("%d",&num);
count++;
if(num<0)
{printf("factorial of negative no. is not possible\n");}
else
{ result=factorial(num);
count++;
printf("the factorial of no. is %d",num,result);
count++;
printf("no. of counts is %d",count);}
getch();
return 0; }
int factorial (int num)
{ count++;
if (num == 0|| num ==1)
{count++;
return 1;}
else
{count++;
return(num*factorial(num-1));}}
OUTPUT:
 PRACTICAL-3(A)
AIM: WAP TO FIND THE FIBONACCI SERIES OF A NO.
PSEUDO CODE:
FN[0]←0
FN[1]←1
for i←2 to n-1 do
{FN[i]←FN[i-1]+FN[i-2]
i=i+1}
return FN[n-1]
Source code:

#include<stdio.h>

int main()

{ int n, first = 0, second = 1, next, c;

printf("Enter the number of terms\n");

scanf("%d",&n);

printf("First %d terms of Fibonacci series are :-\n",n);

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

{ if ( c <= 1 )

next = c;

else

{ next = first + second;

first = second;

second = next; }

printf("%d\n",next); }

return 0; getch(); }
OUTPUT:
 PRACTICAL-3(B)
AIM: WAP TO FIND THE FIBONACCI SERIES OF A NO. USING
RECURSION
PSEUDO CODE:
Fibo(n)
Begin
if n <= 1 then
Return n;
else
Return Call Fibo(n-1) + Call Fibo(n-2);
endif
End
Source code:
#include<stdio.h>j
int Fibonacci(int);
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) );}
OUTPUT:

PRACTICAL-1(A)
AIM: WAP TO FIND THE SUM OF A NO.S
PSEUDO CODE:
SumToN()
Begin
Read: n;
Set sum = 0;
for i = 1 to n by 1 do
Set sum = sum + i;
endfor
Print: sum;
End
Source code:
#include <stdio.h>
int main()
{ int n, sum = 0, c, value;
printf("How many numbers you want to add?\n");
scanf("%d", &n);
printf("Enter %d integers\n", n);
for (c = 1; c <= n; c++)
{ scanf("%d", &value);
sum = sum + value;}
printf("Sum of the integers = %d\n", sum);
return 0;}
OUTPUT:

PRACTICAL-1(B)
AIM: WAP TO FIND THE SUM OF A NO.S USING RECURSION
PSEUDO CODE:
double sum( int n )
{
if ( n ==0 ) // base case
return 0;
// recursive case
return n + sum( n - 1 );
}
Source code:
#include <stdio.h>
void display(int);
int main()
{ int num, result;
printf("Enter the Nth number: ");
scanf("%d", &num);
display(num);
return 0;}
void display(int num)
{ static int i = 1;
if (num == i)
{ printf("%d \n", num);
return; }
else
{ printf("%d ", i);
i++;
display(num); } }

OUTPUT: