Skip to main content

Complex Number Class (C++ with Exception Handling)

This is a Complex Number Class Definition in C++. The basic Operations on Complex Numbers are defined here also, from taking input to Algebra. And it has a tiny example of Exception Handling for new operator

#include <iostream.h>
class complex{
private:
float *x,*y;

public:
complex(float a=0.0, float b=0.0)
{
 try{
  x=new float;
  *x=a;
  y=new float;
  *y=b;
}
catch(...)
 {
  cout<<"Memory is not sufficient";
 }
}

complex operator + (complex c){
 complex z;
 *(z.x)=(*x) + *(c.x);
 *(z.y)=(*y) + *(c.y);
 return z;
}

complex operator - (complex c){ // Binary Minus
 complex z;
 *(z.x)=(*x) - *(c.x);
 *(z.y)=(*y) - *(c.y);
 return z;
}

complex operator - (){ // Unary Minus
complex z;
*(z.x)=-(*x);
*(z.y)=-(*y);
return z;
}

complex operator * (complex c){
 complex z;
 *(z.x)=(*x)*(*(c.x))-(*y)*(*(c.y));
 *(z.y)=(*y)*(*(c.x))+(*x)*(*(c.y));
 return z;
}

complex operator / (complex c){
 complex z;
 float t;
 t=(*(c.x))*(*(c.x)) + (*(c.y))*(*(c.y));
 *(z.x)=((*x)*(*(c.x)) + (*y)*(*(c.y)))/t;
 *(z.y)=((*y)*(*(c.x)) - (*x)*(*(c.y)))/t;
 return z;
}

friend ostream & operator << (ostream &o,complex c);
friend istream & operator >> (istream &i,complex c);
};



ostream & operator << (ostream &o,complex c){
 if (*(c.y)>=0.0)
 o<<*(c.x)<<"+"<<*(c.y)<<"i";
 else
 o<<*(c.x)<<*(c.y)<<"i";

 return o;
}

istream & operator >> (istream &i,complex c){
cout<<"(Real Part):: ";
i>>*(c.x);
cout<<"(Img. Part):: ";
i>>*(c.y);

return i;
}


void main()
{
 complex a,b,c;
 cout<<"Enter complex Number 1:: ";
 cin>>a;
 cout<<"Enter complex Number 2:: ";
 cin>>b;
 cout<<"The Complex Numbers are::\nA="<<a<<endl<<"B="<<b;
 cout<<"\n-B="<<-b;           //Negetive of Complex Number
 cout<<"\nA+B="<<a+b;         //Addition of Complex Numbers
 cout<<"\nA-B="<<a-b;         //Subtraction of Complex Numbers
 cout<<"\nAxB="<<a*b;         //Multiplication of Complex Numbers
 cout<<"\nA/B="<<a/b;         //Division of Complex Numbers

}

This may not run on all Turbo C++ Compiler due to exception handling code.

Labels:

Comments

Post a Comment

Popular posts from this blog

Class Point:: It holds co-ordinates of a point in format (x,y)

A class Named "Point" which stores the Co-ordinates of a point in (x,y) Format. This Class Contains:: O Constructor with default arguments O Copy Constructor O Function to display which Co-ordinate a Point belongs to O Function to get value of x of a point O Function to get value of y of a point O Function to get the Radious Vector (r) of a point O Function to get the Theta of a point O Overloaded Operator - to find out distance between two points O Overloaded Operator >> to take input O Overloaded operator O Destructor #include<iostream.h> #include<math.h> class point{ //Data Members int x,y; //They hold the value of X and Y co-ordinate of a Point. public: //Member Functions point(int t1=0, int t2=0) //Constructor with default arguments. { x=t1; y=t2; } point(point &t) //Copy Constructor { x=t.x; y=t.y; } int coordinate(void); //It returns the point's Co-ordinate, e.g., 1, 2, 3, or 4th. int getx(...
Post a Comment
Read more

0s and 1s Count in 1 Byte Memory Word

This program will count all the 1s and 0s individualy presents in a 1 byte word. And store the result in individual places in Memory. Suppose, argument byte is stored in memory location 2050H and store the result of 1's count at 2060H memory location and 0's at 2061H Memory Location Hex Code Label Mnemonics Comment 3050 3051 3052 3A 50 20 START: LDA 2050H ;Load Accumulator with the number stored at location 2050H 3053 3054 06 00 MVI B, 00H ;Initiate 0's Counter 3055 3056 0E 00 MVI C, 00H ;Initiate 1's Counter 3057 3058 16 08 MVI D, 08H ;Initiate Bit Counter 3059 07 LOOP: RLC ;Rotate Accumulator Left with Carry 305A 305B 305C DA 61 30 JC ONE ;If 1 is found count 1 305D 04 INR B ;If 1 is not found it must be 0. So increase 0's Counter 305E 305F 3060 D2 62 30 JNC NEXT ;Go to next Bit 3061 0C ONE: INR C ;Increase 1's Counter 3062 15 NEXT: DCR D ;Decrease the Bit Counter 3063 3064 3065 C2 ...
Post a Comment
Read more