Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Overloading Binary Operators
class SI
{float i,p,n,r,a;
public:
SI(){};
SI(int gp,int gn, int gr);
void putdata(void);
SI operator+(SI);
};
SI SI::operator+(SI i1)
{SI i2; i2.p=p+i1.p; i2.i=i+i1.i; i2.a=a+i1.a; return i2;
}
void SI::putdata(void)
{cout<<"Principle is: "< cout<<"Interest is "< cout<<"Amount is "< } SI::SI(int gp,int gn, int gr) {p=gp;n=gn;r=gr; i=(p*n*r)/100; a=p+i; } int main() { SI i1,i2,i3; i1=SI(1000,2,10); i1.putdata(); cout< return 0; }
cout<<"Interest is "< cout<<"Amount is "< } SI::SI(int gp,int gn, int gr) {p=gp;n=gn;r=gr; i=(p*n*r)/100; a=p+i; } int main() { SI i1,i2,i3; i1=SI(1000,2,10); i1.putdata(); cout< return 0; }
cout<<"Amount is "< } SI::SI(int gp,int gn, int gr) {p=gp;n=gn;r=gr; i=(p*n*r)/100; a=p+i; } int main() { SI i1,i2,i3; i1=SI(1000,2,10); i1.putdata(); cout< return 0; }
SI::SI(int gp,int gn, int gr)
{p=gp;n=gn;r=gr; i=(p*n*r)/100; a=p+i;
int main()
{ SI i1,i2,i3;
i1=SI(1000,2,10); i1.putdata(); cout< return 0; }
return 0;
Question: (a) (i) What is recursion? (ii) What advantage is there in its use? (iii) What disadvantage is there in its use? (b) The factorial of a positive number can b
C program to print fibonacci series: int fibo(long int); void main() { long int a=0,n; printf ("how many terms\n");
assume that the first integer read with cin specifies the number of values remaining to be entered. that program should read only one value each time cin is executed .a typical inp
How can one handle a destructor that fails?
answer
T o k e n : Tokens are small entities in a program. Example: identifiers, keywords, constants, operators, strings, etc. These tokens are used almost in same wa
how to create database of faculty database......... send me with program
Program to check even and odd numbers: int main() { int your_number; cout cin >> your_number;
pseudo code that will determine if the number is prime or composite
find the occurence of zy in the final string
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd