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 Using Friend Function
class SI
{float i,p,n,r,a;
public:
SI(){};
SI(int gp,int gn, int gr);
void putdata(void);
friend SI operator+(SI,SI);
};
SI operator+(SI i1,SI i2)
{SI i3; i3.p=i1.p+i2.p; i3.i=i1.i+i2.i; i3.a=i1.a+i2.a; return i3;
}
void SI::putdata(void)
{cout<<"Principle 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;
Aim: To implement a program to display a rectangle, circle and triangle. Code: class shape { public: vir
what is dynamic memory?
Suppose we use Lists to represent a movie which has a title, cast and year. For example, the following list represents the movie, "Die Hardly", with the cast "Bruce Willing" and "T
convert BST into sorted doubly linked list
Define F u n c t i o n? T h e r e a r e t w o t y p e s o f f u n ct i o n b u i l t - i n f un ct i o n s a n d u
THIS PROGRAM IS TO ADD TWO DISTANCES & SHOW THEIR SUM AS NEW DISTANCE # include # include typedef int dist; struct distance { dist inch; dist feet; }; distance add
Are comments included during compilation stage and placed in EXE file as well? - No, comments encountered by compiler are disregarded. - Their only purpose is ease and guida
A: The simplest instance of a smart pointer is auto_ptr that is included in the standard C++ library. Auto Pointer only takes care of Memory leak & does nothing regarding dangling
Write a program that finds the minimum total number of shelv, C/C++ Programming
Implementation of the Stack class in C++: How to implement stack class in c++. int Stack::push(int elem) { if (top { list[top++] = elem; r
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