Hi everyone who are going to learn little bit in my blog. I felt we people good at marks percentage and even enough good at communication, drastically failed in understand the problem, making logic and even we do not make an attempt to solve. Coding is nothing a big deal after we make a little try to understand/listen how it will doing their process systematically. So in my blog i put my level best coding to help the people who are trying to improve their coding skill. If you face any trouble/ difficulties comment it via comment box i will surely help you to clarifying your doubts. I will write a program for most expected one in Interview/ HR...... "ALL THE BEST"
(* indicate more important topic)
ADDITION OF TWO NOS:
#include<stdio.h> Input: 5 6
#include<conio.h> Output: 11
int main()
int a,b,c;
clrscr();
printf("Enter a,b");
scanf("%d %d",&a,&b);
c=a+b;
printf("\n Addition=%d",c);
return(0);
}
(Sub, mul is similar to addition only the operator change)
DIVISION OF TWO NOS:
#include<stdio.h> Input: 8 2
#include<conio.h> Output: 4.00000
int main()
{ 
int a,b;
float c;
clrscr();
printf("Enter a,b");
scanf("%d %d",&a,&b);
c=(float)a/b;
printf("\n Division=%f",c);
return(0);
}
AVERAGE OF 3 NOS:
#include<stdio.h> Input: 8 2 4
#include<conio.h> Output: 4.66666
int main()
{
int a,b,c;
float avg;
clrscr();
printf("Enter a,b,c");
scanf("%d %d %d",&a,&b,&c);
avg=(float)(a+b+c)/3;
printf("\n Average=%f",c);
return(0);
}
* SWAPPING OF TWO NOS:
#include<stdio.h> Input: 50 30
#include<conio.h> Output: Before Swapping 50 30
int main() After Swapping 30 50
{
int a,b,c;
clrscr();
printf("Enter a,b");
scanf("%d %d",&a,&b);
printf("Before swapping %d %d",a,b);
c=a;
a=b;
b=c;
printf("\ After swapping %d %d",a,b);
return(0);
}
DIVISION WITHOUT USING '/ 'SYMBOL:
#include<stdio.h> Input: 8 2
#include<conio.h> Output: 4
int main()
{
int num,den,temp1,temp2,i;
clrscr();
printf("Enter Numerator,Denominator");
scanf("%d %d",&num,&den);
temp1=num;
for(i=1;i<temp1;i++)
{
num=num-den;
if(num==0)
temp2=i;
else if(num==1)
temp2=i;
}
printf("Division %d",temp2);
return(0);
}
POWER WITHOUT USING pow():
#include<stdio.h> Input: a=2 b=3
#include<conio.h> Output: power 2^3 = 8
int main()
{
int a,b,m,i;
clrscr();
printf("Enter a,b");
scanf("%d %d ",&a,&b);
m=1;
for(i=1;i<=b;i++)
m=m*a;
printf(" Power %d^%d=%d",a,b,m);
return(0);
}
* GIVEN NO IS EVEN OR ODD:
#include<stdio.h> Input: 8 / 5
#include<conio.h> Output: Given no is even / Given no is odd
int main()
{
int n,i
clrscr();
printf("Enter n");
scanf("%d",&a);
if(n%2==0)
printf("\n Given no is even");
else
printf("\n Given no is odd");
return(0);
}
GREATEST OF 3 NOS:
#include<stdio.h> Input: 2 5 8
#include<conio.h> Output: 8 is greater
{
int a,b,c;
clrscr();
printf("Enter a,b,c");
scanf("%d %d %d",&a,&b,&c);
if(a>b&&a>c)
printf(" %d is greater",a);
else if(b>c)
printf(" %d is greater",b);
else
printf("%d is greater",c);
return(0);
}
* SINGLE LOOP:
#include<stdio.h> Output: i=10 j=20
#include<conio.h> i=11 j=21
int main() i=12 j=22
{
int i,j;
clrscr();
for(i=10,j=20;i<=12,j<=22;i++,j++)
printf("\n i=%d j=%d",i,j);
return(0);
}
* PRINT N NOS IN NORMAL & REVERSE:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Output: Normal order 1 2 3 4
int main() Reverse order 4 3 2 1
{
int i,n;
clrscr();
printf("enter n");
scanf("%d",&n);
printf("\n Normal order");
for(i=1;i<=n;i++)
printf("\t%d",i);
printf("\nReverse order");
for(i=n;i>=1;i--)
printf(" \t%d",i);
return(0);
}
*SUM OF N NOS:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Ouput: sum is 10 (1+2+3+4)
int main()
{
int n,i,s;
clrscr();
printf("Enter n");
scanf("%d",&n);
s=0;
for(i=1;i<=n;i++)
s=s+i;
printf("\n sum is=%d",s);
return(0);
}
*FACTORIAL OF GIVEN NO:
#include<stdio.h> Input: Enter n 4
#include<conio.h> Output:Factorial of given no 24(4*3*2*1 )
int main()
{
int i,n;long f;
clrscr();
printf("Enter n");
scanf("%d",&n);
f=1;
for(i=1;i<=n;i++)
f=f*i;
printf("Factorial of given no %ld",f);
return(0);
}
*FIBONACCI'S SERIES UPTO N:
#include<stdio.h> Input:Enter n 4
#include<conio.h> Output: 0 1 2 3 (add prev 2 val)
int main()
{
int i,n,a,b,c;
printf("enter n");
scanf("%d",&n);
a=-1;b=1;
for(i=1;i<=n;i++)
{
c=a+b;
printf("\t%d",c);
a=b;
b=c;
}
return(0);
}
* CHECK WHETHER THE GIVEN NO IS PRIME OR NOT:
#include<stdio.h> Input: Enter n 17
#include<conio.h> Ouput: Prime no 17
int main()
{
int i,n,f;
clrscr();
printf("Enter n");
scanf("%d",&n);
f=1;
for(i=2;i<sqrt(n);i++)
if(n%i==0)
{f=0;
break;
}
if(f==1)
printf("Prime no%d",n);
else
printf("Not Prime %d",n);
return(0);
}
*REVERSE A GIVEN NO:
#include<stdio.h> Input: Enter n 4567
#include<conio.h> Output : 7654
int main()
{
int n,s,r;
clrscr();
printf("Enter n");
scanf("%d",&n);
s=0;
while(n!=0)
{
r=n%10;
s=s*10+r;
n=n/10;
}
printf(" %d",s);
return(0);
}
*CHECK THE GIVEN NO IS PALINDROME OR NOT:(more important)
#include<stdio.h> Input: Enter n 1221
#include<conio.h> Output :Palindrome 1221 (reverse no =given no)
int n,s,m,r;
clrscr();
printf("Enter n");
scanf("%d",&n);
s=0;m=n;
while(n!=0)
{
r=n%10;
s=s*10+r;
n=n/10;
}
if(m==s)
printf("Palindrome%d",m);
else
printf("Not palindrome%d",m);
return(0);
}
*CHECK WHETHER GIVEN STRING IS PALINDROME OR NOT:(important)
#include<stdio.h> Input: Enter String malayalam
#include<conio.h> Output : Palindrome malayalam
#include<string.h>
int main()
{
int n,i,j;int f;
char a[20];
clrscr();
printf("Enter String");
scanf("%s",a);
n=strlen(a);
j=n-1;f=1;
for(i=0;i<n/2;i++)
{
if(a[i]!=a[j])
{
f=0;
break;
}
j--;
}
if(f==1)
printf("Palindrome%s",a);
else
printf("Not palindrome%s",a);
return(0);
}
*CHECK WHETHER GIVEN NO IS ARMSTRONG OR NOT:
#include<stdio.h> Input: Enter n 153
#include<conio.h> Output : Armstrong(3^3+5^3+1^3=153)153
int main()
{
int n,s,r,m;
clrscr();
printf("Enter n");
scanf("%d",&n);
s=0;m=n;
while(n!=0)
{
r=n%10;
s=s+r*r*r;
n=n/10;
}
if(m==s)
printf("Armstrong%d ",m);
else
printf("Not Armstrong %d",m);
return(0);
}
Keep On Tracking My Blog to get more programs related to Company Asked Frequently!!!!
For array based concept refer my second post
