HOME PAGE
www.pradheep.cjb.net (or)
www.geocities.com/pradheepkumar


			OOPS LAB
			~~~~ ~~~


// 1 - OBJECTS AND CLASSES - BANK ACCOUNT
# include <iostream.h>
# include <stdlib.h>
# include <conio.h>
class bankaccount
	{
		private :
			char name[15];
			char acctype;
			double balance;
			int acctno;
		public :
			bankaccount()
				{ balance=0; }
			void deposit(double amount)
				{
					balance=balance+amount;
					cout<<"Balance = Rs."<<balance<<endl;
				}
			void display()
				{
					cout<<"Name	     : "<<name<<endl<<"Account number :"<<acctno;
					cout<<endl<<"Account type : "<<acctype;
					cout<<endl<<"Balance      : "<<balance<<endl;
				}
			void withdraw(double amount);
			int createaccount(int ac);
	};
void main ()
	{
		int choice;
		int acct=0;
		double amount;
		bankaccount person[10];
		do
			{
			cout<<"\nBank account - Menu\n"<<endl<<"1 - New account"<<endl;
			cout<<"2 - Deposit"<<endl<<"3 - Withdraw"<<endl<<"4 - Display";
			cout<<endl<<"5 - Quit"<<endl<<endl<<"Enter your choice : ";
			cin>>choice;
			switch(choice) {
				case 1 : cout<<"acct = "<<acct<<endl;
							acct=person[acct].createaccount(acct);
							break;
				case 2 : cout<<"Enter account number : ";
							cin>>acct;
							cout<<"Enter amount : ";
							cin>>amount;
							person[acct-1].deposit(amount);
							break;
				case 3 : cout<<"Enter account number : ";
							cin>>acct;
							cout<<"Enter amount : ";
							cin>>amount;
							person[acct-1].withdraw(amount);
							break;
				case 4 : cout<<"Enter account number : ";
							cin>>acct;
							person[acct-1].display();
							break;
				case 5 : exit(1);
			  default : cout<<"Illegal choice - try again";
			}
		getch();
		clrscr();
		}while(choice!=5);
	}

void bankaccount::withdraw(double amount)
		{
			while((balance-amount)<500)
			{
				cout<<"Minimum balance in account should be Rs.500/-"<<endl;
				cout<<"Enter amount : ";
				cin>>amount;
			}
			balance=balance-amount;
			cout<<"Balance = Rs."<<balance<<endl;
		}
int bankaccount::createaccount(int ac)
		{
			cout<<"Enter name : ";
			cin>>name;
			cout<<"Enter amount : ";
			cin>>balance;
			while (balance<500)
			{
				cout<<"Minimum of Rs.500/-";
				cout<<endl<<"Enter amount : ";
				cin>>balance;
			};
			cout<<"Enter account type : ";
			cin>>acctype;
			acctno=++ac;
			cout<<"Account number : "<<acctno<<endl;
			return (acctno);
		}

// 2 - CONSTRUCTORS

# include <iostream.h>
# include <string.h>

class string {

	private :
		char str[20];

	public :
		string ()
			{ str[0]='\0'; }

		string (char text[])
			{ strcpy(str,text); }

		void readstring()
			{
				cout<<"Enter string : ";
				cin>>str;
			}

		void putstring()
			{ cout<<str<<endl; }

		string operator + (string s)
			{
				char temp[20];
				strcpy(temp,str);
				strcat(temp,s.str);
				return string(temp);
			}

		string operator += (string s)
			{
				char temp[20];
				strcpy(temp,str);
				strcat(temp,s.str);
				return string(temp);
			}
};

void main ()
{
	string s1, s2("Morning"), s3, s4, s5("Boy"), s6;
	s1.readstring();
	s3=s1+s2;
	s4.readstring();
	s6=s4+=s5;
	s3.putstring();
	s6.putstring();
}

// 3 - FRIEND FUNCTIONS
# include <iostream.h>
# include <stdlib.h>
class DB ;
enum boolean {FALSE,TRUE};
class DM
{
	private :
		float mtr, cm;
	public :
		DM ()
			{mtr=cm=0.0;}
		void getinput ()
		{
			cout<<"Enter in metre : ";
			cin>>mtr;
			cout<<"Enter centimetres : ";
			cin>>cm;
		}
		void display ()
		{
			cout<<mtr<<"m  "<<mtr;
			cout<<cm<<"cm";
		}
		DM (float x)
		{
			mtr=int(x/100);
			cm=x-mtr*100;
		}
		friend float operator + ( DM x, DB y);
};
class DB
{
	private :
		float feet, inch;
	public :
		DB ()
			{feet=inch=0.0;}
		DB (float x)
		{
			feet=int(x/30);
			inch=((x/30)-feet)*12;
		}
		void getinput ()
		{
			cout<<"Enter in feet : ";
			cin>>feet;
			cout<<"Enter inches : ";
			cin>>inch;
		}
		void display ()
		{
			cout<<feet<<"' ";
			cout<<inch<<"''";
		}
		friend float operator + ( DM x, DB y);
};
void main ()
{
	DM a,c;
	DB b,d;
	boolean flag=FALSE;
	int choice;
	do
	{
		cout<<"\nMenu";
		cout<<"\n1 - Input data";
		cout<<"\n2 - Result in metre and centimetres";
		cout<<"\n3 - Result in feet and inches";
		cout<<"\n4 - Exit";
		cout<<"\nEnter choice ";
		cin>>choice;
		switch (choice)
		{
			case 1 	: 	a.getinput();
							b.getinput();
							flag=TRUE;
							break;
			case 2 	:  if (flag!=FALSE)
							{
								c=a+b;
								c.display();
							}
							else
								cout<<"No input data";
							break;
			case 3 	:  if (flag!=FALSE)
							{
								d=a+b;
								d.display();
							}
							else
								cout<<"No input data";
							break;
			case 4 	: 	exit(0);
			default 	: 	cout<<"Illegal choice"<<endl;
		}
	}while (choice!=4);
}
float operator + ( DM x, DB y)
{
	float DMcm = x.mtr*100+x.cm;
	float DBcm = y.feet*30+y.inch*2.5;
	return(DMcm+DBcm);
}

// 4 - TYPE CONVERSION IN SOURCE
// POLAR TO RECTANGULAR
#include <iostream.h>
#include <math.h>
class rec
{
	private :
		float xco, yco;
	public :
		rec() {xco=yco=0.0;}
		rec(float x, float y)
			{	xco=x;yco=y; }
		void put ()
		{
			cout<<"x = "<<xco;
			cout<<endl<<"y = "<<yco;
		}
};
class polar
{
	private :
		float rad, ang;
	public :
		operator rec()
		{
			float x=rad*cos(ang);
			float y=rad*sin(ang);
			return rec(x,y);
		}
		polar() { rad=ang=0.0;}
		polar (float x, float y)
			{	rad=x; ang=y; }
		void get ()
		{
			cout<<"Enter radians : ";
			cin>>rad;
			cout<<"Enter angle : ";
			cin>>ang;
		}

};

void main ()
{
	polar p;
	rec r;
	p.get();
	r=p;
	r.put();
}

// 5 - TYPE CONVERSION IN DESTINATION
// RECTANGULAR TO POLAR
#include <iostream.h>
#include <math.h>
class rec;
class polar
{
	private :
		float rad, ang;
	public :
		polar() { rad=ang=0.0;}
		void get ()
		{
			cout<<"Enter radians : ";
			cin>>rad;
			cout<<"Enter angle : ";
			cin>>ang;
		}
		float getrad() { return (rad);}
		float getang() { return (ang);}
};
class rec
{
	private :
		float xco, yco;
	public :
		rec() {xco=yco=0.0;}
		void put ()
		{
			cout<<"x = "<<xco;
			cout<<endl<<"y = "<<yco;
		}
		rec (polar p)
		{
			float r=p.getrad();
			float a=p.getang();
			xco=r*cos(a);
			yco=r*sin(a);
		}
};
void main ()
{
	polar p;
	rec r;
	p.get();
	r=p;
	r.put();
}

// 6 - INHERITANCE
# include <iostream.h>
# include <conio.h>
# include <stdlib.h>
# include <stdio.h>
class publication
	{
		private :
			char title[20];
			float price;
		public :
			publication ()
				{
					title[0]='\0';
					price=0.0;
				}
			void getdata()
				{
					cout<<"Enter title : ";
					fflush(stdin);
					scanf ("%[^\n]s",title);
					cout<<"Enter price : ";
					cin>>price;
				}
			void putdata()
				{
					cout<<"\nTitle : "<<title;
					cout<<"\nPrice : Rs."<<price;
				}
	};
class book : public publication
	{
		private :
			int page;
		public :
			book()
				{
					publication :: publication();
					page=0;
				}
			void getdata()
				{
					publication::getdata();
					cout<<"Enter number of pages : ";
					cin>>page;
				}
			void putdata()
				{
					publication::putdata();
					cout<<"\nPages : "<<page<<endl;
				}
	};
class tape : public publication
	{
		private :
			float time;
		public :
			tape ()
				{
					publication :: publication();
					time=0.0;
				}
			void getdata()
				{
					publication::getdata();
					cout<<"Enter time : ";
					cin>>time;
				}
			void putdata()
				{
					publication::putdata();
					cout<<"\nTime   : "<<time<<"  minutes"<<endl;
				}
	};
int i=0,j=0;
void main ()
	{
		int ch, temp;
		book books[5];
		tape tapes[5];
		do
			{
				clrscr();
				cout<<"\nMenu";
				cout<<"\n1 - Enter book details ";
				cout<<"\n2 - Enter tape details ";
				cout<<"\n3 - Display book details ";
				cout<<"\n4 - Display tape details ";
				cout<<"\n5 - Exit";
				cout<<"\nEnter choice : ";
				cin>>ch;
				switch (ch)
					{
						case 1 : books[i].getdata();
									++i;
									break;
						case 2 : tapes[j].getdata();
									++j;
									break;
						case 3 : if (i==0)
										cout<<"List is empty";
									else
										for (temp=0;temp<i;temp++)
											books[temp].putdata();
									break;
						case 4 : if (j==0)
										cout<<"List is empty";
									else
										for (temp=0;temp<j;temp++)
											tapes[temp].putdata();
									break;
						case 5 : exit(0);
					  default : cout<<"Illegal choice";
					}
				getch();
		}while (ch!=5);
	}

// 7 - OPERATOR OVERLOADING
# include <iostream.h>
# include <math.h>
class polar
{
	private :
		float r, ang;
	public :
		polar ()
		{	r=ang=0.0; }
		polar (float x, float y)
		{
			r=x; ang=y;
		}
		void getdata()
		{
			cout<<"Enter r : ";
			cin>>r;
			cout<<"Enter angle(in degree) : ";
			cin>>ang;
		}
		void display()
		{
			cout<<"r = "<<r<<"angle = "<<ang;
		}
		polar operator + (polar p)
		{
			float x3=(r*cos(ang*3.1412/180))+(p.r*cos(p.ang*3.1412/180));
			float y3=(r*sin(ang*3.1412/180))+(p.r*sin(p.ang*3.1412/180));
			return polar(sqrt(x3*x3+y3*y3), atan(y3/x3)*180/3.1412);
		}
};
void main ()
{
	polar p1, p2, p3;
	p1.getdata();
	p2.getdata();
	p3=p1+p2;
	p3.display();
}

// 8 - DATA STRUCTURES - ORDERED LINKED LIST

# include <iostream.h>
# include <alloc.h>

struct node
{
	int data;
	node *link;
};

class list
{
	private :
		node *first;

	public :

		list () {first=NULL;}
		void insert (int element);
		void delet(int element);
		void display ();
};
void list :: insert (int element)
{
	int flag=0;
	node *temp;
	node *newnode=new node;
	newnode->data=element;
	newnode->link=NULL;
	if (first==NULL)
		first=newnode;
	else
	{
		if (element<first->data)
		{
			newnode->link=first;
			first=newnode;
		}
		else
		{
			temp=first;
			while (temp->link!=NULL)
			{
				if (temp->link->data<element)
					temp=temp->link;
				else
				{
					newnode->link=temp->link;
					temp->link=newnode;
					flag=1;
					break;
				}
			}
			if (!flag)
				temp->link=newnode;
		}
	}
}

void list :: delet(int element)
{
	int flag=0;
	node *temp;
	temp=first;
	if (!temp)
		cout<<"List is empty\n";
	else if (temp->data==element)
	{
		first=temp->link;
		free(temp);
		cout<<"List after deletion..\n";
	}
	else
	{
		while (temp->link!=NULL)
		{
			if (temp->link->data==element)
			{
				temp->link=temp->link->link;
				flag=1;
				cout<<"List after deletion...\n";
				break;
			}
			temp=temp->link;
		}
		if (!flag)
			cout<<"Element not found";
	}
}

void list :: display ()
{
	node *temp;
	temp=first;
	if (!temp)
		cout<<"List is empty...";
	else
	{
		cout<<"List contains...\n";
		while (temp)
		{
			cout<<temp->data<<" ";
			temp=temp->link;
		}
		cout<<endl;
	}
}

void main ()
{
	list obj;
	int ch, data;
	do
	{
		cout<<"\nMenu\n1 - Insert\n2 - Delete\n3 - Display\n4 - Exit";
		cout<<"\nEnter choice : ";
		cin>>ch;
		switch (ch)
		{
			case 1  :  cout<<"Enter data : ";
						  cin>>data;
						  obj.insert(data);
						  cout<<"List after insertion...";
						  obj.display();
						  break;

			case 2  :  cout<<"Enter data : ";
						  cin>>data;
						  obj.delet(data);
						  obj.display();
						  break;

			case 3  :  obj.display();
						  break;

			case 4  :  break;

			default :  cout<<"Illegal choice\n";
		}
	}while (ch!=4);
}

// 9 - DATA STRUCTURES - STACK
# include <iostream.h>
# include <stdio.h>
# include <conio.h>
# include <stdlib.h>
# include <alloc.h>
struct node
	{
		int data;
		node *link;
	};
class stack
	{
		private :
			node *top;
		public :
			stack() { top=NULL; }
			void push();
			void pop();
			void display();
	};
void stack :: push()
	{
		node *newnode=new node;
		newnode->link=NULL;
		cout<<"Enter data : ";
		cin>>newnode->data;
		if (top==NULL)
			top=newnode;
		else
			{
				newnode->link=top;
				top=newnode;
			}
	}
void stack :: pop()
	{
		if (top==NULL)
			cout<<"Stack is empty";
		else
			{
				node *temp;
				temp=top;
				top=top->link;
				free(temp);
			}
	}
void stack :: display ()
	{
		node *temp=top;
		if (!temp)
			cout<<"Stack is empty";
		else
			{
				while (temp!=NULL)
					{
						cout<<temp->data<<" ";
						temp=temp->link;
					}
				cout<<"\n|";
			}
	}
void main ()
	{
		int ch;
		stack obj;
		do
			{
				clrscr();
				cout<<"\nStack - Menu\n1 - Push\n2 - Pop\n3 - Display";
				cout<<"\n4 - Exit\nEnter choice : ";
				cin>>ch;
				switch(ch)
					{
						case 1 : obj.push();
									break;
						case 2 : obj.pop();
									break;
						case 3 : obj.display();
									break;
						case 4 : break;
					}
         	getch();
			} while (ch!=4);
	}

// 10 - DATA STRUCTURES - QUEUE
# include <iostream.h>
# include <stdlib.h>
struct node
	{
		int data;
		node *link;
	};
class queue
	{
		private :
			node *front, *rear;
		public :
			queue () { front=rear=NULL; }
         void display();
			void insert (int element)
				{
					node *newnode=new node;
					newnode->data=element;
					newnode->link=NULL;
					if (front==NULL&&rear==NULL)
						front=rear=newnode;
					else if (rear==NULL)
						{
							rear=newnode;
							if (front==NULL)
								front=newnode;
						}
					else
						{
							rear->link=newnode;
							rear=newnode;
						}
				}
			void deleto()
				{
					node *temp;
					if (front==NULL)
						cout<<"Queue is empty";
					else
					{
						temp=front;
						if (front==rear)
							{
								free(temp);
								front=rear=NULL;
							}
						else
							{
								front=front->link;
								free(temp);
							}
					}
				}
	};
void queue :: display()
	{
		node *temp;
		temp=front;
		if (!temp)
			cout<<"Queue is empty";
		else
			{
				while (temp)
					{
						cout<<temp->data<<" ";
						temp=temp->link;
					}
			}
	}
void main ()
	{
		queue obj;
		int choice, element;
		do
			{
				cout<<"\nQueue - Menu\n1 - Insert\n2 - Delete\n3 - Display";
				cout<<"\n4 - Exit\nEnter choice : ";
				cin>>choice;
				switch(choice)
					{
						case 1 : cout<<"Enter data : ";
									cin>>element;
									obj.insert(element);
									break;
						case 2 : obj.deleto();
									break;
						case 3 : cout<<"\nQueue is ...\n";
									obj.display();
									break;
						case 4 : break;
					  default : cout<<"Illegal choice";
					}
			} while (choice!=4);
	}

// 11 - DATA STRUCTURES - BINARY TREE
# include <iostream.h>
struct node
	{
		int data;
		node *left, *right;
	};
class Btree
	{
		private :
			node *root;
		public :
			Btree() { root=NULL; }
			node *getroot() { return root ;}
			void insert();
			node *search(info);
			void traverse();
			void inorder (node *rt);
	};
node* Btree :: search(int info)
	{
		struct node *temp, *prev;
		temp=root;
		while (temp)
			{
				if (info>temp->data)
					{
						prev=temp;
						temp=temp->right;
					}
				else if (info<temp->data)
					{
						prev=temp;
						temp=temp->right;
					}
				else
					prev=temp=NULL;
			}
		return prev;
	}
void Btree :: insert()
	{
		node *new1, *temp, *prev;
		temp=root;
		new1=new node;
		cout<<"Enter data : ";
		cin>>new1->data;
		new1->left=new1->right=NULL;
		if (!temp)
				root=new1;
		else
		{
			prev=search(new1->data);
			if (prev)
				{
					if (new1->data>prev->data)
						prev->right=new1;
					else
						prev->left=new1;
				}
			else
				cout<<"Data exists - cannot insert ";
		}
	}
void Btree :: inorder (node *rt)
	{
		if (!rt)
			return;
		inorder(rt->left);
		cout<<rt->data<<" ";
		inorder(rt->right);
		return;
	}
void Btree :: traverse ()
	{
		if(!root)
			cout<<"Empty tree";
		else
			inorder(root);
	}

void main ()
	{
		int ch;
		Btree a;
		do
			{
				cout<<"\nBinary Tree - Menu\n1 - Insert\n2 - Display\n3 - Exit";
				cout<<"\nEnter choice : ";
				cin>>ch;
				switch(ch)
					{
						case 1 : a.insert();
									break;
						case 2 : a.traverse();
									break;
						case 3 : break;
					}
			} while (ch!=3);
	}

// 12 - VIRTUAL FUNCTIONS
# include <iostream.h>
# include <conio.h>
class shape
	{
		protected :
			float x,y;
		public :
			shape () {x=y=0.0;}
			virtual void display_area()=0;
	};
class triangle : public shape
	{
		protected :
			float area;
		public :
			triangle() { area=0.0;}
			void getdata()
				{
					cout<<"Enter base length : ";
					cin>>x;
					cout<<"Enter height : ";
					cin>>y;
					area=0.5*x*y;
				}
			void display_area()
				{
					cout<<"\nArea of triangle = "<<area;
				}
	};
class rectangle : public shape
	{
		protected :
			float area;
		public :
			rectangle () { area=0.0; }
			void getdata()
				{
					cout<<"Enter length : ";
					cin>>x;
					cout<<"Enter breadth : ";
					cin>>y;
					area=x*y;
				}
			void display_area()
				{
					cout<<"\nArea of rectangle = "<<area;
				}
	};
void main ()
	{
		int ch, i=0,j;
		shape *ptr[10];
		triangle triobj,*tri;
		rectangle recobj,*rec;
		do
			{
				clrscr();
				cout<<"\nMenu\n1 - Triangle\n2 - Rectangle\n3 - Display all";
				cout<<"\n4 - Exit\nEnter choice : ";
				cin>>ch;
				switch (ch)
					{
						case 1 : tri=&triobj;
									tri->getdata();
									ptr[i]=tri;
									ptr[i]->display_area();
									i++;
									break;
						case 2 : rec=&recobj;
									rec->getdata();
									ptr[i]=rec;
									ptr[i]->display_area();
									i++;
									break;
						case 3 : for (j=0;j<i;j++)
										ptr[j]->display_area();
									break;
						case 4 : break;
					  default : cout<<"\nIllegal choice";
					}
				getch();
		} while (ch!=4);
	}

// 13 - COPYING FILES
# include <fstream.h>
# include <iostream.h>
int main (int argc, char *argv[])
	{
		char ch;
		int blank=1;
		ifstream infile;
		if (argc!=3)
			{
				cout<<"Not enough parameters\n";
				return 1;
			}
		ofstream outfile (argv[2]);
		infile.open(argv[1],ios::nocreate);
		if (!infile)
			{
				cout<<"File "<<argv[1]<<" does not exist\n";
				return 1;
			}
		while (!infile.eof())
			{
				ch=infile.get();
				switch(ch)
					{
						case '\n' : ++blank;
										break;
						case ' '  : ++blank;
										break;
						default   : blank=0;
										outfile.put(ch);
					}
				if (blank==1)
					outfile.put(ch);
			}
		return 0;
	}

// 14 - BINARY FILE
# include <fstream.h>
class record
	{
		private :
			char name[32];
			long int phone;
		public :
			record()
				{
					name[0]=NULL;
					phone=0;
				}
			void getdata()
				{
					cout<<"Enter name : ";
					cin>>name;
					cout<<"Enter phone : ";
					cin>>phone;
				}
			void putdata()
				{
					cout.setf(ios::left, ios::adjustfield);
					cout.width(15);cout<<name;
					cout.setf(ios::right,ios::adjustfield);
					cout.width(10);cout<<phone<<endl;
				}
		};
void main ()
	{
		fstream outf("phone",ios::app);
		int n;
		record p;
		cout<<"Enter number of records : ";
		cin>>n;
		for (int i=0;i<n;i++)
			{
				p.getdata();
				outf.write((char *)&p,sizeof(p));
			}
		outf.close();
		outf.open("phone",ios::in);
		cout.setf(ios::left,ios::adjustfield);
		cout.width(15);cout<<"\nName";
		cout.setf(ios::right,ios::adjustfield);
		cout.width(10);cout<<"Phone"<<endl<<endl;
		do
			{
				outf.read((char *)&p,sizeof(p));
				if (!outf.eof())
					p.putdata();
			} while (!outf.eof());
	}


Get More Tech Bits from
www.pradheep.cjb.net/tech.htm (or)
www.geocities.com/pradheepkumar/tech.htm