INHERITANCE USING C++



/*HOSPITAL MANAGEMENT USING INHERITANCE*/

PROGRAM: 
#include<iostream.h>
#include<conio.h>
class hospital
{
 private:
            char doc[20];
            int rno,pho;
 public:
            void getdata();
            void display();
}h;
class patient
{
 private:
            char name[20],dis[25],add[20];
            int phno,rno;
 public:
            void getdata();
            void display();
}p;
class details:public hospital,public patient
{
 public:
            void getdata();
            void display();
}d;
void hospital::getdata()
{
 cout<<"\n Enter doctor name:";
 cin>>doc;
 cout<<"\n Enter doctor room no:";
 cin>>rno;
 cout<<"\n Enter doctor phone no:";
 cin>>pho;
}
void patient::getdata()
{
 cout<<"\n Enter patient name:";
 cin>>name;
 cout<<"\n Enter patient address:";
 cin>>add;
 cout<<"\n Enter Room no :";
 cin>>rno;
 cout<<"\n Enter patient diseases:";
 cin>>dis;
 cout<<"\n Enter phone no:";
 cin>>phno;
}
void hospital::display()
{
 cout<<"\n Doctor name       :"<<doc<<endl;
 cout<<"\n Doctor Roomno     :"<<rno<<endl;
 cout<<"\n Doctor phone no   :"<<pho<<endl;
}

void patient::display()
{
 cout<<"\n Patient name    :"<<name<<endl;
 cout<<"\n Roomno          :"<<rno<<endl;
 cout<<"\n Diseases        :"<<dis<<endl;
 cout<<"\n Patient phone no:"<<phno<<endl;
}
void details::getdata()
{
 hospital::getdata();
 patient::getdata();
}
void details::display()
{
 patient::display();
 hospital::display();
}
void main()
{
 clrscr();
 cout<<"\n\t HOSPITAL MANAGEMENT USING INHERITANCE";
 cout<<"\n\t ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n";
 cout<<"\n Enter the details";
 d.getdata();
 cout<<"\n Patient details";
 d.display();
 getch();
}

 OUTPUT:


         HOSPITAL MANAGEMENT USING INHERITANCE
         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

 Enter the details

 Enter doctor name:VINOTH

 Enter doctor room no:20

 Enter doctor phone no:245678

 Enter patient name:VIVEK

 Enter patient address:KARUMATHAMPATTI, CBE

 Enter Room no :201

 Enter patient diseases:FEVER

 Enter phone no:2598020


 Patient details

 Patient name               :VIVEK

 Roomno                      :201

 Diseases                     :FEVER

 Patient phone no        :2598020

 Doctor name              :VINOTH

 Doctor Roomno         :20

 Doctor phone no        :245678


Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include &
Read more

BOOKS DETAILS USING C STRUCTURE

              To write a c program to create a collection of books using array of structure and performs the following operatons. (i)                  Searching a book with title and author name. (ii)                Sort the book based on title. /*BOOKS DETAILS*/ #include<stdio.h> #include<conio.h> #include<string.h> struct books { char book[20]; char author[20]; int price; }; int main() { int i,ch,j,n,flag=1; struct books l[10]; struct books t[1]; char sbook[20],saut[20]; clrscr(); do{ clrscr(); printf("\n\t\tBOOK LIST\n\nMAIN MENU\n\n"); printf("\n1.creation\n2.search by title & author\n"); printf("3.sort by title\n4.exit\n"); printf("\nEnter your choice:"); scanf("%d",&ch); switch(ch) { case 1: clrscr(); printf("\nEnter number of booklist:"); scanf("%d",&n); for(i=1;i<=n;i+
Read more

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

TRAVELING SALESMAN USING BRANCH AND     BOUND TECHNIQUE  #include<iostream.h> #include<conio.h> int main() { int i,j,k,n,min,g[20][20],c[20][20],s,s1[20][1],s2,lb; clrscr(); cout<<"\n TRAVELLING SALESMAN PROBLEM"; cout<<"\n Input number of cities:"; cin>>n; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { c[i][j]=0; }} for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i==j) continue; else{ cout<<"input"<<i<<"to"<<j<<"cost:"; cin>>c[i][j]; } } } for(i=2;i<=n;i++) { g[i][0]=c[i][1]; } for(i=2;i<=n;i++) { for(j=2;j<=n;j++) { if(i!=j) g[i][j]=c[i][j]+g[j][0]; } } for(i=2;i<=n;i++) { for(j=2;j<=n;j++) { if(i!=j) break; } } for(k=2;k<=n;k++){ if(i!=k && j!=k){ if((c[i][j]+g[i][k])<(c[i][k]+g[k][j])) { g[i][j]=c[i][j]+g[j][k]; s1[i][j]=j; } else { g[i][1]=c[i][k]+g[k][j];
Read more