C++ HOME WORK PROGRAMMS
ans 2:-
/*input meter no., 1st & last meter reading,connection type.
calculate the bill amount as per the following conditions
connection type rate per unit service tax surcharge
1 0.25 0% 0
2 2.50 2% 500
3 4.75 6% 1000
4 8.50 10% 2000
bill amount = amount + surcharge + service tax */
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int s1,s2,ct,a,u,st,sur,ba;
start:
cout<<"enter first meter reading\n";
cin>>s1;
cout<<"enter last meter reading\n";
cin>>s2;
u=s2-s1;
cout<<"select connection type\n1\t2\t3\t4\n";
cin>>ct;
clrscr();
if(ct==1)
{
a=u*0.25;
st=0;
sur=0;
}
else if(ct==2)
{
a=u*2.50;
st=a*0.02;
sur=500;
}
else if(ct==3)
{
a=u*4.75;
st=a*0.06;
sur=1000;
}
else if(ct==4)
{
a=u*8.50;
st=a*0.1;
sur=2000;
}
else
{
cout<<"\ninvalid input try again\n";
goto start;
}
clrscr();
ba=a+st+sur;
cout<<"bill amount = "<<ba;
cout<<"\nunits consumed = "<<u;
getch();
}
Q4- write a program to input a no. and test weather it is prime or not.
ans::::
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,b=0;
cin>>n;
for(i=1;i<=n;i++)
{
if(n%i==0)
b++;
}
if(b==2)
cout<<n<<" is prime.";
else
cout<<n<<" is not prime.";
getch();
}
ans::::
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,b=0;
cin>>n;
for(i=1;i<=n;i++)
{
if(n%i==0)
b++;
}
if(b==2)
cout<<n<<" is prime.";
else
cout<<n<<" is not prime.";
getch();
}
Q5:- perfect no.,
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,c=0;
cin>>n;
for(i=1;i<=n/2;i++)
{
if(n%i==0)
c=c+i;
}
if(c==n)
cout<<n<<"\t is perfect no.";
else
cout<<n<<"\t is not a perfect no.";
getch();}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,c=0;
cin>>n;
for(i=1;i<=n/2;i++)
{
if(n%i==0)
c=c+i;
}
if(c==n)
cout<<n<<"\t is perfect no.";
else
cout<<n<<"\t is not a perfect no.";
getch();}
Q6:- to display factorial
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,n;
cin>>n;
if(n>0)
{
for(i=n-1;i>0;i--)
{
n=n*i;
}
cout<<"factorial of inputed no. is"<<n;
}
if(n==0)
cout<<"factorial = 1";
if(n<0)
cout<<"factorial of negative no. is not defined";
getch();
}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,n;
cin>>n;
if(n>0)
{
for(i=n-1;i>0;i--)
{
n=n*i;
}
cout<<"factorial of inputed no. is"<<n;
}
if(n==0)
cout<<"factorial = 1";
if(n<0)
cout<<"factorial of negative no. is not defined";
getch();
}
Q7:- sum of digits
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
long n,b,a=0;
cin>>n;
while(n>0)
{
b=n%10;
a=a+b;
n=n/10;
}
cout<<a;
getch();}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
long n,b,a=0;
cin>>n;
while(n>0)
{
b=n%10;
a=a+b;
n=n/10;
}
cout<<a;
getch();}
ans 8- palindrome number
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
long a,k,s=0,t;
cout<<"enter the no.,\t";
cin>>a;
k=a;
while(a>0)
{
t=a%10;
s=t+(10*s);
a/=10;
}
if(s==k)
cout<<"\n no., is palindrome";
else
cout<<"\n no., is not a palindrome";
getch();
}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
long a,k,s=0,t;
cout<<"enter the no.,\t";
cin>>a;
k=a;
while(a>0)
{
t=a%10;
s=t+(10*s);
a/=10;
}
if(s==k)
cout<<"\n no., is palindrome";
else
cout<<"\n no., is not a palindrome";
getch();
}
ans 9(a)- pattern
#include<iostream.H>
#include<conio.h>
void main()
{
clrscr();
int i,j;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
cout<<j;
cout<<endl;
}
getch();}
#include<iostream.H>
#include<conio.h>
void main()
{
clrscr();
int i,j;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
cout<<j;
cout<<endl;
}
getch();}
ans 9(b)- pattern
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j;
for (i=5;i>=1;i--)
{
for(j=2;j<=i;j++)
cout<<" ";
for(j=5;j>=i;j--)
cout<<j;
cout<<"\n";
}
getch();}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j;
for (i=5;i>=1;i--)
{
for(j=2;j<=i;j++)
cout<<" ";
for(j=5;j>=i;j--)
cout<<j;
cout<<"\n";
}
getch();}
ans 9(c)- pattern
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=4;j>=i;j--)
cout<<" ";
j=1;
for(k=1;k>0;)
{
cout<<k;
if(j==0)
{
k--;
continue;
}
if(k<i)
k++;
else
{
k--;
j=0;
}
}
cout<<"\n";
}
getch();}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=4;j>=i;j--)
cout<<" ";
j=1;
for(k=1;k>0;)
{
cout<<k;
if(j==0)
{
k--;
continue;
}
if(k<i)
k++;
else
{
k--;
j=0;
}
}
cout<<"\n";
}
getch();}
ans 9(d)- pattern
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=2;j<=i;j++)
cout<<" ";
j=1;
for(k=5;k<6;)
{
cout<<k;
if(j==0)
{
k++;
continue;
}
if (k>i)
k--;
else
{
k++;
j=0;
}
}
cout<<"\n";
}
getch();
}
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j,k;
for(i=1;i<=5;i++)
{
for(j=2;j<=i;j++)
cout<<" ";
j=1;
for(k=5;k<6;)
{
cout<<k;
if(j==0)
{
k++;
continue;
}
if (k>i)
k--;
else
{
k++;
j=0;
}
}
cout<<"\n";
}
getch();
}