BINARY TO DECIMAL CONVERSION:
#include<stdio.h>
#include<conio.h> Input: 1101
#include<conio.h> Input: 1101
#include<math.h> Output: 13
int main()
{
int n,r,i,s;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
i=0;s=0;
while(n!=0)
{
r=n%10;
s=s+r*pow(2,i);
i++;
n=n/10;
}
printf("\n %d",s);
}
DECIMAL TO BINARY CONVERSION:
#include<stdio.h>
#include<conio.h> Input: 13
#include<conio.h> Input: 13
#include<math.h> Output: 1101
int main()
{
int n,r,i,s;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
i=0;s=0;
while(n!=0)
{
r=n%2;
s=s+r*pow(10,i);
i++;
n=n/2;
}
printf("\n %d",s);
}
CHECK GIVEN CHARACTER IS VOWEL OR NOT:
#include<stdio.h> Input: Enter a character e
#include<ctype.h> Output: vowel
int main()
{
char ch;
clrscr();
printf("Enter a character");
scanf("%c",&ch);
ch=tolower(ch);
switch(ch)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
printf("Vowel");
break;
default:
printf("Not a vowel");
}
return(0);
}
REVERSE PRINTING OF ELEMENT IN AN ARRAY:
#include<stdio.h> Input: Enter n 3
#include<conio.h> Enter ele : 30 20 10
int main() Ouput: 10 20 30
{
int n,i;int a[20];
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf(" Enter ele");
scanf("%d",&a[i]);
}
for(i=n-1;i>=0;i;i--)
printf("\t %d",a[i]);
return(0);
}
*BIGGEST OF N NO:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 79 01
int main() Output: 79
{
int n,i,a[10],big; clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("\nEnter ele");
printf("\nEnter ele");
scanf("%d",&a[i]);
}
big=a[0];
for(i=0;i<n;i++)
{
if(a[i]>big)
big=a[i];
}
printf(" %d",big);
return(0);
}
*SECOND BIGGEST NO IN AN ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 79 01
int main() Output: First Biggest 79
{ Second Biggest 45
int n,i,a[10],big1,big2;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
big1=a[0];
for(i=0;i<n;i++)
{
if(a[i]>big1)
big1=a[i];
}
printf("\nFirst biggest %d",big1);
for(i=0;i<n;i++)
if(a[i]!=big1)
{
big2=a[i];
break;
}
for(i=0;i<n;i++)
{
if(a[i]>big2 && a[i]!=big1)
big2=a[i];
}
printf("\nSecond biggest %d",big2);
return(0);
}
*SEARCH A GIVEN NO IN AN ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 79 01
int main() Enter Search element 45
{ Output: Available
int n,i,a[10],sno,f;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
printf("Enter search element");
scanf("%d",&sno);
f=0;
for(i=0;i<n;i++)
{
if(a[i]==sno)
{
f=1;
break;
for(i=0;i<n;i++)
}
}
if(f==1)
printf("Available%d",sno);
else
printf("Not Available%d",sno);
return(0);
}
*COPYING AN ARRAY TO ANOTHER ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 79 01
int main() Output: Array b 23 45 79 01
{
int n,i,a[10],b[10],j;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
{
b[i]=a[i];
}
for(i=0;i<n;i++)
printf("Array b\n");
printf("Array b\n");
printf(" \t%d",b[i]);
return(0);
}
*INSERT AN ELEMENT IN AN ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 79 01
int main() Enter position & value 3 98
{ Output: 23 45 98 79 01
int n,i,a[10],p,v;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
printf("Enter a position & value");
scanf("%d%d",&p,&v);
for(i=n;i>=p;i--)
a[i]=a[i-1];
a[i]=v;
n++;
for(i=0;i<n;i++)
printf("%d",a[i]);
return(0);
}
*DELETE AN ELEMENT IN AN ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 70 01
int main() Enter position 3
{ Output: 23 45 79
int n,i,a[10],p;
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
printf("\nEnter a position ");
scanf("%d%d",&p);
for(i=p;i<=n;i++)
a[i-1]=a[i];
n--;
for(i=0;i<n;i++)
printf("%d",a[i]);
return(0);
*REMOVE A DUPLICATE NO IN AN ARRAY:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Enter ele 23 45 45 45 78
int main() Output: 23 45 78
{
int n,i,,j,k,a[10];
clrscr();
printf("\n Enter n");
scanf("%d",&n);
for(i=0;i<n;i++)
{printf("\nEnter ele");
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]==a[j])
if(a[i]==a[j])
{
for(k=j+1;k<n;k++)
a[k]=a[k-1];
}
}
}
}n--;
for(i=0;i<n;i++)
printf("\t %d",a[i]);
return(0);
}
No comments:
Post a Comment