1.
Input values in array and print
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[10],i,n;
printf("enter value of n:");
scanf("%d",&n);
printf("\nenter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("\n array values are \n");
for(i=0;i<n;i++)
{
printf("%d",a[i]);
}
}
2. Array elements sum and average
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[10],i,n,sum=0;
float avg;
printf("enter values:");
scanf("%d",&n);
printf("enter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
sum=sum+a[i];
avg=(float)sum/n;
}
printf("sum is:%d\n",sum);
printf("avg is:%.2f",avg);
}
3. Find index of given element in array [33,44,55,66,77], search=44
44 is available at index =1, search=80. This is not available in array
Sol-
#include<stdio.h>
int main(){
int a[10],i,j,n,d=0,found;;
printf("enter no. of array:");
scanf("%d",&n);
for(i=0; i<n; i++){
printf("enter elemet of array is:");
scanf("%d",&a[i]);
}
printf("search elemant:");
scanf("%d",&d);
found=0;
for(int j =0; j<=n; j++){
if(a[j] == d){
printf("This no. is on:%d",j);
found=1;
break;}
}
if(found==0)
{
printf("This is not available in array");
}
}
4. Sort Elements of Array in Ascending Order [44,3,6,7,2]
output- 2,3,6,7,44
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[20],i,n,j,t;
printf("enter value of n:");
scanf("%d",&n);
printf("\nenter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
printf("elements in ascending order\n");
for(i=0;i<n;i++)
printf("%d",a[i]);
}
5. Sort Elements of Array in Descending Order- [55,44,3,4,2,33]
output- 55,44,33,4,3,2
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[20],i,n,j,t;
printf("enter value of n:");
scanf("%d",&n);
printf("\nenter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]<a[j])
{
t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
printf("elements in descending order\n");
for(i=0;i<n;i++)
printf("%d",a[i]);
}
6. Count Even numbers in Array- [44,55,6,7,8]
Event count is =3
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[10],n,i,count=0;
printf("enter value of n:");
scanf("%d",&n);
printf("\nenter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]%2==0)
count+=1;
}
printf("total even values are:%d",count);
}
7. Count Odd numbers in Array- [22,33,44,5,6]
Odd count is = 2
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{int a[10],n,i,count=0;
printf("enter value of n:");
scanf("%d",&n);
printf("\nenter array value\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
if(a[i]%2!=0)
count+=1;
}
printf("total odd values are:%d",count);
}
8. Count Digits in Each element of Array- [345,6,78,95,245]
Sol-
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],i,n,j,count=0;
printf("Enter the size of array: ");
scanf("%d",&n);
printf("\nEnter the values in array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=a[i];j>0;count++)
{
j=j/10;
}
printf("\nElement count is: %d",count);
count=0;
}
}
9. Calculate Addition of each element of array- [345,66,77,88,65]
Sol-
#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],i,n,j,sum,rem;
printf("Enter the size of array: ");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("\nEnter Values in array: ");
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
sum=0;
for(j=a[i];j>0;)
{
rem=j%10;
sum=sum+rem;
j=j/10;
}
printf("\nSum of each element of array is: %d",sum);
}
getch();
}
10. Find and Print prime numbers in array- [33,4,5,66,7]
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{
int a[20],i,j,temp,n;
printf("Enter the size of array: ");
scanf("%d",&n);
printf("\nEnter the values in array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
temp=0;
for(j=2;j<a[i];j++)
{
if(a[i]%j==0)
{
temp=1;
break;
}
}
if(temp==0)
printf("\nPrime Numbers are: %d",a[i]);
}
return 0;
}
11. Count prime numbers in Array- [33,4,5,66,7]
Sol-
#include<stdio.h>
#include<conio.h>
int main()
{
int a[20],i,j,temp,n,count=0;
printf("Enter the size of array: ");
scanf("%d",&n);
printf("\nEnter the values in array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
temp=0;
for(j=2;j<a[i]/2;j++)
{
if(a[i]%j==0)
{
temp=1;
break;
}
}
if(temp==0)
{
printf("\nPrime Numbers are: %d",a[i]);
count++;
}
}
printf("\n Prime Count = %d", count);
return 0;
}