Skip to main content

Program for Multi Level Inheritance and Function Overriding

Program for Multi Level Inheritance and Function Overriding:
Function overriding is a very key programming feature in OOP system. This allows programmers to create objects which has similar function ( with same name) but having different implementations. Such technique is really helpful in situations where each object has a common function but implementations ( games for example).

Multi Level Inheritance:
In this type of inheritance one class inherits B inherits a base class A. After that B acts as a base class for next class C. So B inherits A, C inherits B.
in this example we have a base class "animal".
The next class "Tiger" inherits "animal".
Then "SaberTooth" inherits "Tiger".
Both Tiger and SaberTooth get the functionality of Base class Animal.
Function Overriding:

This is the feature that can change the behaviour of inherited function in derived class. Here we will change the inherited function "attack()". Note that overridden function may have completely different functioning then original

Code:

#include<iostream>

using namespace std;

//--Our base class
class animal
{
    public:
    int life;// base class has an attribute that will get passed to derived classes
    animal()
    {
        life=100;        
    }
    void say()
    {
        cout<<"\n This is Animal Class with Health="<<life;
    }
    void showHealth()
    {
        cout<<"\n Health="<<life;
    }
};

//---Tiger class inherits animal class so gets all his public members:
//---life
//--say()
//---showHealth()
class Tiger : public animal
{
    public:
    Tiger()
    {
        
    }
    void attack()
    {
        cout<<"\n This class can Attack !!";
    }
};
//--this class inherits tiger class also gets his public members:
//--attack()
//--this class has its own member data bigFangs
//--this also overrrides the inherited attack function
class SaberTooth : public Tiger
{
    public:
    int bigFangs;
    SaberTooth()
    {
        bigFangs=10;
    }
    // redefining inherited method will overrride it
    void attack()
    {
        cout<<"\n this class can attack with "<<bigFangs<<" inch Jawz\n";
    }
    
};

int main()
{
    animal a;
    a.say();
    a.showHealth();
    
    cout<<"\n---- Tiger Class-----\n";
    Tiger t;
    t.showHealth();// <--gets it from animal class
    t.attack();//<--its own
    cout<<"\n---- SaberTooth Class-----\n";
    SaberTooth s;
    s.showHealth();//<--from base class to tiger then to this
    s.attack();//<--Overrrided method
}

output:

Popular posts from this blog

Find nth Prime Number in C++

c++ program to find prime numbers: The problem of finding prime number can be solved by checking all numbers, testing them for prime and then moving ahead. If you want to calculate nth prime. Then this can be done in a brutal way by checking the number one by one. This may sound odd, by there is no easy way then this  for prime numbers (Well Actually there are like Pollard's Rho Algorithm, Number Sieves or Shor's Quantum Algorithm, but we are talking about the one that most people may understand easily). There may be way to pre-calculate the prime numbers but that again is not sufficient. So how can we use c++ to create a program to find prime numbers.

Program to find nth Prime number in C

Objective: To print any Prime number in C.  This task may sound easy but is a very good exercise to help optimize CPU intensive programs. Finding Prime number is a very CPU hogging task and it becomes even more dreaded as the number starts to grow. Lets say we want to find 30001th prime. how will we find it?? Here is the program. Programming logic : The easiest method is to check if the given number N is divisible by any number from 2 to N-1. But it may be noted that we don't need to go beyond the number that is square root of N.  why?? lets have a look. Say we are testing number 49 for prime number. Our objective is to find any number that may divide it. so we start from 2,3,4 etc. As soon as we cross 7 there will be no number that will divide 49, if there was we have got it earlier since it will be smaller then 7.  Get it? another example 64 : 2x32 4x16 8x8 16x4 32x2 as you can see when we pass number 8 we don't need to test as the number that will come ,...