Skip to main content

Classes and Objects in PYTHON (Object Oriented Programming)

Solving a problem by creating objects is one of the most popular approach in programming. This is called Object Oriented Programming






This concept is based on using reusable code but differently from functions.
It is based on DRY (Don't Repeat Yourself) Principle.

CLASS :-

A class is a blueprint for creating objects. It can described as a group of objects. Objects are the instances of a class. We will further define this in our upcoming code in this post.

Lets see a basic program for the class and objects to understand it properly.




From that simple code you learn the use of classes and object. Now we will see the other methods of using classes in more simpler and shorter ways :-





Hope you understood the above code. We had used f-string method to print the whole detail which is more simpler and shorter than the previous code. In this method, we don't have to write the print command so many times. So making it shorter to write and less time consuming.

Now, lets see another way which is more shorter and simpler than the above one. This is also more important than the previous two methods. So, get ready for a flight :-





So these were the simplified programs of OOPS in PYTHON. Hope you understood the topic. In the next post, we will learn about Linked List. 

If you like this post then please share it with your friends and help them learning python.




John Veer
Contact mail id - john.vcer.utube@gmail.com
Contact us for any query!
Thanks for reading !
Share it with your friends
www.basicpythonprogramme.blogspot.com

Comments

Post a Comment

Popular posts from this blog

Binary Search Tree and Binary Heap in PYTHON

Here is the Python code for Binary Search Tree :- Content included:- 1.) Insertion 2.) Search Operation 3.) Deletion 4.) Minimum Node 5.) Maximum Node 6.) Preorder Traversal 7.) InOrder Traversal 8.) PostOrder Traversal class BST: def __init__(self, data): self.root = data self.left = None self.right =None def insertnode(self, data): if self.root is None: self.root = data return if self.root is data: return elif self.root > data: if self.left is not None: self.left.insertnode(data) else: self.left = BST(data) elif self.root data: if self.left is not None: self.left.searchoprn(data) else: print("Data is not present.") elif self.root self.root: if self.right: selfright = self.right.deletenode(data) ...
Post a Comment
Read more

Doubly Linked List in PYTHON

  Here is the Python code for the Doubly Linked List :- #first of all creat a class node class Node :     def __init__ ( self , data ):         self . data = data         self . next = None         self . prev = None #now create a class of doubly linked list class DLL :     def __init__ ( self ):         self . head = None #function to insert the node at begining     def insertatbeg ( self , data ):         newnode = Node ( data )         newnode . prev = None         newnode . next = self . head         self . head = newnode #function to insert the node at the end     def insertatend ( self , data ):         newnode = Node ( data )         if self . head is None :             self . head ...
Post a Comment
Read more

Queues in PYTHON

  The Python Code for Queue is here :- class Node: def __init__(self, data): self.data = data self.next = None class Queue: def __init__(self): self.front = self.rear = None def enqueue(self, data): newnode = Node(data) newnode.next = self.rear self.rear = newnode if self.front is None: self.front = newnode def dequeue(self): temp = self.rear while temp.next is not self.front: temp = temp.next self.front = temp temp.next = None def traverse(self): temp = self.rear while temp is not None: print(temp.data, end = " --> ") temp = temp.next print("None") new = Queue() new.enqueue(4) new.enqueue(1) new.enqueue(0) new.enqueue(2) new.traverse() new.dequeue() new.traverse() new.dequeue() new.traverse() 2 --> 0 --> 1 --> 4 --> None 2 --> 0 --> 1 --> None 2 ...
1 comment
Read more