Skip to main content

Object Oriented Programming (OOP)

Object Oriented Programming:

Object Oriented Programming (OOP) is a programming concept which used in the modern programming world. Languages like Java, C++,  and Python support Object Oriented Programming (OOP). It works on the principle that objects are the most important part of a program. In OOP we think in terms of objects and every object has its attributes (properties) and a state (behavior/functions).
Object Oriented Programming (OOP) is a technique of system modeling and its main purpose is to understand the product before developing it and manipulating these objects to achieve a specific task.

 

Pillars of Object Oriented Language (OOP):

There are four basic principles of Object Oriented Language (OOP).
  • Inheritance
  • Polymorphism
  • Data Encapsulation
  • Abstraction



WHY is Object Oriented Language (OOP) NEEDED?

Problems with Procedural Languages:

  • Functions have unrestricted access to global data
  • Unrelated Functions and data.

Before Object Oriented Programming programs were viewed as procedures that accepted data and produced an output. There was little emphasis given to the data that went into those programs.

 

Advantages of Object Oriented Language (OOP):

  • Data Secure: data is hidden from outside world.
  • Code Reusability: Reusability is one of its main features.
  • Flexibility: code can be easily changed.

Difference Between Procedure and Object Oriented Programming Language:

Procedure Oriented Programming
Object Oriented Programming
 Programs are divided into small parts called functions.Program is divided into parts called objects.
Functions are given more importance than data. Importance is given to the data rather than procedures or functions because it works as a real world.
Data can move freely from function to function in the system. Objects can interact with each other through member functions to achieve a specific task.
To add new data and function is not so easy. Most function uses Global data for sharing that can be accessed freely from function to function in the system. OOP provides an easy way to add new data and function. In OOP, we can keep data public or private to control the access of data.
Procedure language does not have any way to hide data. OOP provides Data Hiding so provides more security.
 Examples are C, VB, FORTRAN, Pascal.Examples are C++, JAVA, VB.NET, C#.NET.

Class:

Class is a blueprint of an object. A class can be anything that can be unique on any base. In Object Oriented world main goal is to identify the classes and make them interact with each other to achieve a specific task.

What is a Class?

Basically class is a collection of data and behavior (code) under one roof. Class name is usually a noun and function are verbs?

Comments

Popular posts from this blog

Pointers

Pointers: A pointer is a variable whose value is a memory address. A pointer contains the memory address of a variable that, in turn, contains a specific value. In this sense, a variable name directly references a value, and a pointer indirectly references a value. Syntax: type * variable ; Interpretation: The value of the pointer variable ptr is a memory address. A data item whose address is stored in this variable must be of the specified type. Dynamic Memory Management: C/C++ enables programmers to control the allocation and deallocation of memory in a program for any built in or user defined type. The ability for a program to obtain more memory space at execution time to hold new nodes, and to release space no longer needed is known as dynamic memory management. Syntax: int *num = (int *)malloc(sizeof (int)*numCount); or int *ptr = (int *)calloc(numCount, sizeof (int)); /* returns a pointer to a section of memory just large enough to hold the integers, whose q...

Single LinkList in Java

Linked List: Linked List contains a sequence nodes which are linked together. Each node contains a connection to another link and data. Linked list is the second most-used data structure after array. Following are the important terms to understand the concept of Linked List. Link − Each link of a linked list can store a data called an element. Next − Each link of a linked list contains a link to the next link called Next. LinkedList − A Linked List contains the connection link to the first link called First. Types of Linked List: Following are the various types of linked list. Simple Linked List − Item navigation is forward only. Doubly Linked List − Items can be navigated forward and backward. Circular Linked List − Last item contains link of the first element as next and the first element has a link to the last element as previous. Basic Operations: Insert:  Inserts at tail,  specific index. Delete: Deletes from the tail.  specific index. ...