Anshul c2
Anshul c2
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
call by value
INPUT:-
#include<stdio.h>
void swap(int,int);
int main()
{
int a=10,b=20;
printf("Value before swapping: a=%d, b=%d\n",a,b);
swap(a,b);
return 0;
}
void swap(int x,int y)
{
int t;
t=x;
x=y;
y=t;
printf("After swapping(Using Call by Value), values are: a=%d, b=%d",x,y);
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
call by reference
INPUT:-
#include<stdio.h>
void swap(int*,int*);
int main()
{
int c=30,d=40;
printf("Values before swapping: c=%d, d=%d\n",c,d);
swap(&c,&d);
return 0;
}
void swap(int*x,int*y)
{
int t;
t=*x;
*x=*y;
*y=t;
printf("After swapping(Using Call by Reference), values are: c=%d, d=%d",*x,*y);
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to find the factorial of a given number using recursion
INPUT:-
#include<stdio.h>
long int mult(int n);
int main()
{
int n;
printf("Enter a positive integer: ");
scanf("%d",&n);
printf("Factorial of %d = %ld", n, mult(n));
return 0;
}
long int mult(int n)
{
if (n>=1)
return n*mult(n-1);
else
return 1;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
INPUT:-
#include<stdio.h>
void Fibonacci(int n){
static int n1=0,n2=1,n3;
if(n>0)
{
n3 = n1 + n2;
n1 = n2;
n2 = n3;
printf("%d ",n3);
Fibonacci(n-1);
}
}
int main()
{
int n;
printf("Enter the number of elements: ");
scanf("%d",&n);
printf("Fibonacci Series: ");
printf("%d %d ",0,1);
Fibonacci(n-2);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to search an element of an array using the linear search
technique
INPUT:-
#include <stdio.h>
int main()
{
int arr[10],search,i,n;
printf("Enter the number of elements in the array: ");
scanf("%d",&n);
printf("Enter the elements of the array: ",n);
for (i=0;i<n;i++ )
scanf("%d",&arr[i]);
printf("Enter the element to search: ");
scanf("%d",&search);
for (i=0;i<n;i++)
{
if (arr[i]==search)
{
printf("%d is present at location %d.\n",search,i+1);
break;
}
}
if (i==n)
printf("%d is not present in the array\n",search);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to sort the elements of an array using Bubble Sort
INPUT:-
#include<stdio.h>
int main()
{
int arr[100],i,n,d,swap;
printf("Enter the number of elements you want to add in an array: ");
scanf("%d",&n);
printf("Enter the integers of the array: \n",n);
for (i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for (i=0;i<n-1;i++)
{
for (d=0;d<n-i-1;d++)
{
if (arr[d]>arr[d+1])
{
swap=arr[d];
arr[d]=arr[d+1];
arr[d+1]=swap;
}
}
}
printf("After Sorting: \n");
for (i=0;i<n;i++)
printf("%d ",arr[i]);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
INPUT:-
#include <stdio.h>
int main()
{
int arr[10];
int size, i;
printf("Enter the size of the array: ");
scanf("%d", &size);
printf("Enter the elements in array: \n");
for(i=0; i<size; i++)
{
scanf("%d", &arr[i]);
}
printf("Array in reverse order: \n");
for(i=size-1;i>=0;i--)
{
printf("%d ",arr[i]);
}
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to find whether the number is an Armstrong number or not
INPUT:-
#include <stdio.h>
int main()
{
int num,ori,rem,res=0;
printf("Enter a three-digit integer: ");
scanf("%d", &num);
ori=num;
while (ori!= 0)
{
rem=ori%10;
res+=rem*rem*rem;
ori/=10;
}
if (res==num)
printf("%d is an Armstrong number.", num);
else
printf("%d is not an Armstrong number.", num);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to find the Maximum and Minimum element of an array and
then swap them
INPUT:-
#include<stdio.h>
#include<conio.h>
void main()
{ int a[10],n,i,max,min,maxpos,minpos,temp;
printf("Enter the number of elements: ");
scanf("%d",&n);
printf("Enter the elements in array: ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
max=a[0];
min=a[0];
maxpos=0;
minpos=0;
for(i=1;i<n;i++)
{ if(a[i]>max)
{ max=a[i];
maxpos=i; }
if(a[i]<min)
{ min=a[i];
minpos=i; }
}
temp=a[maxpos];
a[maxpos]=a[minpos];
a[minpos]=temp;
printf("Maximum element: %d\n",max);
printf("Minimum element: %d\n",min);
printf("Swapping of Maximum and Minimum element: ");
for(i=0;i<n;i++)
{ printf("%d ",a[i]); }
getch(); }
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a program to find a year is a leap year or not using logical operators
INPUT:-
#include<stdio.h>
int main()
{
int year;
printf("Enter a Year: ");
scanf("%d", &year);
if( (year%100==0 && year%400==0) || (year%100!=0 && year%4==0) )
{
printf("%d is a Leap Year\n", year);
}
else
{
printf("%d is not a Leap Year\n", year);
}
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OBJECTIVE– Write a menu driven program for calculator using switch case
INPUT:-
#include <stdio.h>
int main(){
char ch;
int a,b,calc;
printf("Enter the Operator (+, -, *, /): ");
scanf("%c", &ch);
printf("Enter two Operands: \n");
scanf("%d%d",&a,&b);
switch(ch)
{
case '+':
calc=a+b;
break;
case '-':
calc=a-b;
break;
case '*':
calc=a*b;
break;
case '/':
calc=a/b;
break;
}
printf("Calculation: %d",calc);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
#include<stdio.h>
int main()
{
int n,a[10],i,sum=0,avg=0;
printf("Enter the number of elements you want to add in the arary: ");
scanf("%d",&n);
printf("Enter the elements of the array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
avg=sum/n;
}
printf("Sum of array: %d\n",sum);
printf("Average of array: %d",avg);
return 0;
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B
#include<stdio.h>
void main()
{
int i, size;
int arr[]={1, -9, 17, 4, -3};
size=sizeof(arr)/sizeof(arr[0]);
printf("The array elements are: ");
for(i=0;i<size;i++)
{
printf("\narr[%d]= %d", i, arr[i]);
}
}
OUTPUT:-
NAME – ANSHUL LOHANI
COURSE – BCA
ROLL NO. – 2292020
SECTION – B