Embedded Files
WAP to input the marks of 10 students in an array of integers and display the marks.
WAP to input the marks of 10 students in an array of integers and display the marks.
#include<stdio.h>
int main()
{
int i,a[50];
printf("enter array: \n");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<10;i++)
{
printf("%d\n",a[i]);
}
}
WAP to input 20 values in an integer array and count the negative, positive, odd and even values in the array.
WAP to input 20 values in an integer array and count the negative, positive, odd and even values in the array.
#include<stdio.h>
int main()
{
int i;
int c1=0,c2=0,c3=0,c4=0;
int a[20];
printf("enter array: ");
for(i=0;i<20;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<20;i++)
{
if(a[i]<0)
{
c1++;
}
if(a[i]>0)
{
c2++;
}
if(a[i]%2==0)
{
c3++;
}
if(a[i]%2!=0)
{
c4++;
}
}
printf("there are %d negative values\n",c1);
printf("there are %d positive values\n",c2);
printf("there are %d even values\n",c3);
printf("there are %d odd values\n",c4);
}
WAP to calculate the average of 10 values stored in an array and display all those values which are more than the calculated average.
WAP to calculate the average of 10 values stored in an array and display all those values which are more than the calculated average.
#include<stdio.h>
int main()
{
int i,n;
float a[10];
int sum,max,min;
float avg;
printf("enter array: \n");
for(i=0;i<10;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<10;i++)
{
sum=sum+a[i];
}
avg=(float)sum/10;
printf("average is %f\n",avg);
printf("values above %f in the array are: \n",avg);
for(i=0;i<10;i++)
{
if(a[i]>avg)
printf("%f\n",a[i]);
}
}
WAP to reverse an array of floats.
WAP to reverse an array of floats.
#include<stdio.h>
int main()
{
int i,n;
float a[50];
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
printf("reverse of your array is: \n");
for(i=n-1;i>=0;i--)
{
printf("%f\n",a[i]);
}
}
WAP to calculate the average of 10 values stored in an array and display all those values which are more than the calculated average.
WAP to calculate the average of 10 values stored in an array and display all those values which are more than the calculated average.
#include<stdio.h>
int main()
{
int i,n;
float a[10];
int sum,max,min;
float avg;
printf("enter array: \n");
for(i=0;i<10;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<10;i++)
{
sum=sum+a[i];
}
avg=(float)sum/10;
printf("average is %f\n",avg);
printf("values above %f in the array are: \n",avg);
for(i=0;i<10;i++)
{
if(a[i]>avg)
printf("%f\n",a[i]);
}
}
WAP to search how many times a number is present in an array.
WAP to search how many times a number is present in an array.
#include<stdio.h>
int main()
{
int i,c1=0,x,n,a[50];
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("enter number you wish to search: \n");
scanf("%d",&x);
for(i=0;i<n;i++)
{
if(a[i]==x)
c1++;
}
if(c1!=0)
printf("%d is present %d times",x,c1);
else
printf("%d is NOT present",x);
}
WAP to input the sales made by a salesman in every month of a given year and find out the total, average,maximum and minimum sales.
WAP to input the sales made by a salesman in every month of a given year and find out the total, average,maximum and minimum sales.
#include<stdio.h>
int main()
{
int i,a[13],n;
int sum,max,min;
float avg;
printf("enter array: \n");
for(i=0;i<12;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<12;i++)
{
sum=sum+a[i];
}
printf("total is %d\n",sum);
avg=(float)sum/12;
printf("average is %d\n",avg);
max=a[0];
for(i=0;i<12;i++)
{
if(a[i]>max)
{
max=a[i];
}
}
printf("maximum is %d\n",max);
min=a[0];
for(i=0;i<12;i++)
{
if(a[i]<min)
{
min=a[i];
}
}
printf("minimum is %d\n",min);
}
WAP to input 10 values in a float array and display all the values more than 75.
WAP to input 10 values in a float array and display all the values more than 75.
#include<stdio.h>
int main()
{
int i;
float a[10];
printf("enter array: \n");
for(i=0;i<10;i++)
{
scanf("%f",&a[i]);
}
for(i=0;i<10;i++)
{
if(a[i]>75)
printf("%f\n",a[i]);
}
}
WAP to print all the palindrome numbers from an integer array and find out their sum.
WAP to print all the palindrome numbers from an integer array and find out their sum.
#include<stdio.h>
int main()
{
int i;
int n;
int a[50];
int temp,rem,sum;
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("palindromes are: \n");
for(i=0;i<n;i++)
{
temp=a[i];
sum=0;
while(temp!=0)
{
rem=temp%10;
sum=sum*10+rem;
temp=temp/10;
}
if(sum==a[i])
{
printf("%d\n",a[i]);
}
}
}
WAP to rotate an integer array towards right by the given number of times.
WAP to rotate an integer array towards right by the given number of times.
#include<stdio.h>
int main()
{
int i;
int a[50];
int n,temp,x,j;
printf("enter array size: \n");
scanf("%d",&n);
printf("enter times to rotate towards left: \n");
scanf("%d",&x);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(j=1;j<=x;j++)
{
temp=a[n-1];
for(i=n-1;i>=1;i++)
{
a[i]=a[i-1];
}
a[i]=temp;
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
}
}
WAP to rotate an integer array towards left by the given number of times.
WAP to rotate an integer array towards left by the given number of times.
#include<stdio.h>
int main()
{
int i;
int a[50];
int n,temp,x,j;
printf("enter array size: \n");
scanf("%d",&n);
printf("enter times to rotate towards left: \n");
scanf("%d",&x);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(j=1;j<=x;j++)
{
temp=a[0];
for(i=0;i<n-1;i++)
{
a[i]=a[i+1];
}
a[i]=temp;
}
for(i=0;i<n;i++)
{
printf("%d",a[i]);
}
}
WAP to print all the prime numbers from an integer array and find out their sum.
WAP to print all the prime numbers from an integer array and find out their sum.
#include<stdio.h>
int main()
{
int i,j;
int n;
int a[50];
int c1=0;
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("prime numbers are: \n");
for(i=0;i<n;i++)
{
int c1 = 0;
for(j=2;j<a[i];j++)
{
if(a[i]%j==0)
{
c1++;
break;
}
}
if(c1==0)
{
printf("%d\n",a[i]);
}
}
}
WAP which finds the locations and values of largest and second largest element in a one dimensional array
WAP which finds the locations and values of largest and second largest element in a one dimensional array
#include<stdio.h>
int main()
{
int i,a[50],n,largestindex,secondlargestindex;
int max,smax;
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
max=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
{
smax=max;
max=a[i];
largestindex = i;
}
}
printf("maximum is %d\n",max);
printf("maximum value is located at %d\n",largestindex+1);
for(i=0;i<n;i++)
{
if(a[i]>smax && a[i]!=max)
{
smax=a[i];
secondlargestindex = i;
}
}
printf("second max is %d\n",smax);
printf("second maximum value is located at %d\n",secondlargestindex+1);
}
WAP to search how many times a number is present in an array.
WAP to search how many times a number is present in an array.
#include<stdio.h>
int main()
{
int i,c1=0,x,n,a[50];
printf("enter array size: \n");
scanf("%d",&n);
printf("enter array: \n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("enter number you wish to search: \n");
scanf("%d",&x);
for(i=0;i<n;i++)
{
if(a[i]==x)
c1++;
}
if(c1!=0)
printf("%d is present %d times",x,c1);
else
printf("%d is NOT present",x);
}
Page updated
Google Sites
Report abuse