Skip to main content

To implement Friend Class


#include<iostream.h>
#include<conio.h>

 class boy
 { private:
   int income1,income2;
   public:
   void setdata(int n1,int n2)
   { income1=n1;
     income2=n2;
   }
   friend class girl;
 };

 class girl
 { int income;
   public:
   int g_fun(boy b1)
   { return b1.income1+b1.income2;  }

   void set_data(int n)
   { income=n; }

   void show()
   { boy b1;
     b1.setdata(300,500);
     cout<<"\n\n  boy income = "<<b1.income1;
     cout<<"\n\n  girl income = "<<income;
   }
 };

  void main()
  { boy b1;
    girl g1;
    clrscr();
    b1.setdata(100,200);
    g1.set_data(300);
    g1.show();
    cout<<"\n\n  The total income of boy "<<g1.g_fun(b1);
    getch();
  }

Comments

Popular posts from this blog

Use Case Diagram for Online Book Store

Online Movie Ticket Booking Sequence Diagram

Linear search & Binary search using Template

Write a program to search an element from a list. Give user the option to perform Linear or Binary search. Use Template functions. #include<iostream> using namespace std; template <class T> void Lsearch(T *a, T item, int n) { int z=0; for(int i=0;i<n;i++) { if(a[i]== item) { z=1; cout<<"\n Item found at position = "<<i+1<<"\n\n"; } else if(z!=1) { z=0; } } if(z==0) cout<<"\n Item not found in the list\n\n"; } template <class T> void Bsearch(T *a, T item, int n) { int beg=0,end=n-1; int mid=beg+end/2; while((a[mid]!=item) && (n>0)) { if(item>a[mid]) beg=mid; else end=mid; mid=(beg+end)/2; n--; } if(a[mid]==item) cout<<"\n Item found at position = "<<mid+1<<"\n\n"; else cout<<"\n Item not found in the list\n\n"; } void main() { int iarr[10] = {2,42,56,86,87,99,323,546,767,886};