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 Unary Operators Using Friend Function
class sign
{
int a,b,c;
public:
sign(){}; sign(int,int,int); void putdata(void);
friend void operator-(sign &);
};
void operator-(sign &s)
{s.a=-s.a;s.b=-s.b;s.c=-s.c; }
void sign::putdata(void)
{cout<<"a is: "<<a<<"\n"; cout<<"b is "<"\n"; cout<<"c is "<<c<<"\n";
}
sign::sign(int x,int y, int z)
{a=x;b=y;c=z; }
int main()
{sign s; //Implicit constructor calling s=sign(1000,2,10); //Explicit constructor calling s.putdata();
-s;
s.putdata();
cout<<endl;
s=sign(-2000,2,-5);
return 0;
Define conversion operator??
write a promgram using object oriented peramid
how to make a diamond from steric
Assume we wish to partition the square roots of the integers from 1 to 100 in to two piles of fifty numbers every, such that the sum of the numbers in the first pile is as close as
A palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindrome
solution
Designing a deck plan space ship in eclipse.
Luminous Jewels - The Polishing Game Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various lum
Recursive Functions Recursion is a process by which a function includes itself with a condition for its safe exit. It is best suitable for a recursive problem. A typical exampl
how we write decision tables, flowcharts,pseudocode,and algorithm in result management system
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