--%>

Basic features of OOPs

Illustrate the basic features of OOPs?

E

Expert

Verified

There are four basic features of OOPs which are as follows:

  • Abstraction – This feature refers to the method of expopsing simply the appropriate and necessary data to the users not including unnecessary information.
  • Polymorphism – This feature allows us to use an entity in numerous forms.
  • Encapsulation - This feature prevents a data from unnecessary access through binding of code and data in a particular unit called object.
  • Inheritance – It encourages the reusability of code and eradicates the use of unnecessary code. It is a property by which a child class gets all the features described in its parent class. When class inherits the general properties of other class, the class which is inheriting the properties is known as a derived class and the class which permits inheritance of its general properties is known as a base class.

   Related Questions in Programming Languages

  • Q : Define difference between write through

    Define the difference between write through and write back cache?

  • Q : Function of STR and LPSTR Explain what

     Explain what is the function of STR and LPSTR?

  • Q : Define the term Stack trace Define the

    Define the term Stack trace: It is a display of the runtime stack.

  • Q : How does XML maintain white-space in

    How does XML maintain white-space in any documents?

  • Q : Meaning of SBI of an object in the

    Describe the meaning of SBI of an object in the programming?

  • Q : What is Stack overflow Stack overflow :

    Stack overflow: Stack overflow takes place whenever too many items are pushed onto a stack with a finite or limited capacity.

  • Q : Search and Coverage of SPIN Search and

    Search and Coverage of SPIN: SPIN has a highly optimized state exploration algorithm. It supports random, interactive and guided simulation, and both exhaustive and partial coverage, based on either depth-first or breadth-first search.

    Q : Print the factors of each perfect number

    An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to be the number. For example, 6 is a perfect number because 6 = 1+ 2+ 3. Write a function perfect that determines if parameter number is a perfect number. Us

  • Q : Write a recursive implementation of

    Assignment 5 Selecting Array Elements Implement the following C++ code in assembly language, using the block-structured .IF and .WHILE directives. Assume that all variables are 32-bit signed integers: int array[] = {10,60,20,33,72,89,45,65,72,18}; int sample = 50; intArraySize = s

  • Q : Explain Hot spot Hot spot : This is an

    Hot spot: This is an area in an image map with a specific significance. A program usually monitors movements of the mouse, and reacts according to the actions related with the hot spots over which it passes. This may comprise displaying various status