Skip to main content

Inheritance | types of inheritance | inheritance in python,


 Inheritance 

Inheritance is a process in which one object acquires all the properties and behaviors of its parent object automatically. In such a way, you can reuse, extend or modify the attributes and behaviors which are defined in other classes. 

In Java, the class which inherits the members of another class is called derived class and the class whose members are inherited is called base class. The derived class is the specialized class for the base class. 

Types of Inheritance : 

1. Single inheritance : When one class inherits another class, it is known as single level inheritance 

class Shape {

   public void area() {

       System.out.println("Displays Area of Shape");

   }

}

class Triangle extends Shape {

   public void area(int h, int b) {

       System.out.println((1/2)*b*h);

   }  

}


2. Hierarchical inheritance : Hierarchical inheritance is defined as the process of deriving more than one class from a base class. 

class Shape {

   public void area() {

       System.out.println("Displays Area of Shape");

   }

}

class Triangle extends Shape {

   public void area(int h, int b) {

       System.out.println((1/2)*b*h);

   }  

}

class Circle extends Shape {

   public void area(int r) {

       System.out.println((3.14)*r*r);

   }  

}


3. Multilevel inheritance : Multilevel inheritance is a process of deriving a class from another derived class. 

class Shape {

   public void area() {

       System.out.println("Displays Area of Shape");

   }

}

class Triangle extends Shape {

   public void area(int h, int b) {

       System.out.println((1/2)*b*h);

   }  

}

class EquilateralTriangle extends Triangle {

   int side;

}


4. Hybrid inheritance : Hybrid inheritance is a combination of 

simple, multiple inheritance and hierarchical inheritance. 






𝐀𝐦𝐚𝐳𝐨𝐧 𝐥𝐢𝐧𝐤🛍️:-

Comments

Popular posts from this blog

Enter 3 numbers from the user & make a function to print their average in java, c++, python, java.

Enter 3 numbers from the user & make a function to print their average. To find the average of three numbers, you need to add the three numbers together and then divide the sum by three. Here's how you can write a function in C++, C, Python, and Java to take three numbers from the user and calculate their average: JAVA import java . util .*; public class Solutions {     public static void main ( String args []) {        Scanner sc = new Scanner ( System . in );        int a = sc . nextInt ();        int b = sc . nextInt ();        int c = sc . nextInt ();          int average = ( a + b + c ) / 3 ;        System . out . println ( average );    }    }   C++: // c++ #include <iostream> using namespace std ;...

2D Arrays | Java Complete Placement Course | Lecture 11

Java - Introduction to Programming Lecture 11 2D Arrays In Java It is similar to 2D matrices that we studied in 11th and 12th class. Creating a 2D Array - with new keyword int [][] marks = new int [ 3 ][ 3 ] ; Taking a matrix as an input and printing its elements. import java . util .*;   public class TwoDArrays {     public static void main ( String args []) {         Scanner sc = new Scanner ( System . in );         int rows = sc . nextInt ();         int cols = sc . nextInt ();           int [][] numbers = new int [ rows ][ cols ];           //input         //rows         for ( int i = 0 ; i < rows ; i ++) {             //columns  ...

Merge Sort | How do I learn merge sort?

       Merge Sort | For Beginners | Java Placement Course >> Merge sort is a popular sorting algorithm that utilizes a divide-and-conquer approach to sort elements in an array. The basic idea behind merge sort is to divide an unsorted array into two halves, recursively sort each half, and then merge the two sorted halves into a single sorted array. >>  Merge sort algorithm works by recursively dividing an array into two halves, sorting each half, and then merging them to obtain the sorted array. The basic steps of the merge sort algorithm are as follows: Divide the unsorted array into two halves, mid and left. Sort the left half recursively using merge sort algorithm. Sort the right half recursively using merge sort algorithm. Merge the two sorted halves to obtain the final sorted array. JAVA Implementation: // Merge sort public class MergeSort {     //time complexity=nlogn     public static void conquer ( int arr [], int ...