VIRTUAL FUNCTION USING C++



/*BOOK DETAILS USING VIRTUAL FUNCTION */

PROGRAM:

#include<iostream.h>
#include<conio.h>
class author
{
 char aname[20],acon[20];
 long int phn;
public:
 virtual void getdata();
 virtual void display();
}a[10];

class book:public author
{
 char bname[20],pub[20];
 char date[10],ed[10];
public:
 void getdata();
 void display();
}b[10];
void author::getdata()
{
 cout<<"\n\t\t AUTHOR DETAILS";
 cout<<"\n Enter the author name:";
 cin>>aname;
 cout<<"\n enter the author country:";
 cin>>acon;
 cout<<"\n Enter the author phone no:";
 cin>>phn;
}
void author::display()
{
 cout<<"\n Author name   :"<<aname;
 cout<<"\n Author country:"<<acon;
 cout<<"\n Author phoneno:"<<phn;
}
void book::getdata()
{
 cout<<"\n\t\t BOOK DETAILS ";
 cout<<"\n Enter the book name:";
 cin>>bname;
 cout<<"\n Enter the book publish date:";
 cin>>date;
 cout<<"\n Enter the edition:";
 cin>>ed;
 cout<<"\n Enter the publisher name:";
 cin>>pub;
}
void book::display()
{
 cout<<"\n Book name:"<<bname;
 cout<<"\n Publish date:"<<date;
 cout<<"\n edition:"<<ed;
 cout<<"\n Publisher name:"<<pub;
}
void main()
{
 int n,i;
 author *ab[10],*bb[10];
 clrscr();
 cout<<"\n\t\t BOOK DETAILS USING VIRTUAL FUNCTION ";
 cout<<"\n Enter the no of books:";
 cin>>n;
 for(i=0;i<n;i++)
 {
 cout<<i+1<<"Book";
 ab[i]=&a[i];
 bb[i]=&b[i];
 ab[i]->getdata();
 bb[i]->getdata();
 }
 cout<<i+1<<"Details";
 ab[i]=&a[i];
 bb[i]=&b[i];
 ab[i]->display();
 bb[i]->display();
getch();
}

 


OUTPUT:


                 BOOK DETAILS USING VIRTUAL FUNCTION

 Enter the no of books:2
1Book
                 AUTHOR DETAILS
 Enter the author name: Michele E. Davis

 enter the author country:usa

 Enter the author phone no:12456

                 BOOK DETAILS
 Enter the book name:Learning PHP5 and MySQL

 Enter the book publish date:2000

 Enter the edition:3th

 Enter the publisher name:O’Reilly
2Book
                 AUTHOR DETAILS
 Enter the author name:kamthane

 Enter the author country:kanada

 Enter the author phone no:63689

                 BOOK DETAILS
 Enter the book name:c++

 Enter the book publish date:1890

 Enter the edition:4th

 Enter the publisher name:mcgrouhill



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

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - BANKERS ALGORITHM

BANKERS ALGORITHM – SINGLE RESOURCES PROGRAM: #include<stdio.h> main() { int j=0,cmp=0,i,tot,avail,need[20],n,tr,max[20],hold[20]; printf("Enter the number of process"); scanf("%d",&n); printf("Enter the number of resources"); scanf("%d",&tr); printf("Enter the max,need,hold for each process"); for(i=0;i<n;i++) { printf("p%d",i); scanf("%d",&max[i]); scanf("%d",&hold[i]); } tot=0; for(i=0;i<n;i++) { tot=tot+hold[i]; need[i]=max[i]-hold[i]; } avail=tr-tot; while(j!=tr) { for(i=0;i<n;i++) { if(need[i]!=0&&need[i]<=avail) { avail=avail+hold[i]; need[i]=0; printf("%d\t%d\n",i,avail); cmp++; } } j++; } if(avail==tr) printf("safe state"); else printf("unsafe state"); }
Read more