Skip to main content

Conditional Expressions (If/Else or IF/Elif/Else conditions) in Python

Sometimes we want to go outside if its a weekend. 

Sometimes we want to eat ice-cream if its hot.

Sometimes we go for a party with our friends if our parents allow.

All these are the decisions which depends upon a condition. In python programming too, we must met those condition to take a decision. 
For example :- If the value of variable i is 2. Then we will print the value of i if it is greator than 3. Then in this example our condition doesn't met properly. So as a result nothing will be printed. 

So here to give these commands to the computer, we must know the syntax.

Here we need If/Else condition or if there are many conditions then we will apply If/Elif/Else condition.

So lets take an example :-




Now we have understood how to apply if/else condition lets take one more example :-




Use of "and " in the conditions



Use of "or" in the condition




Now we have understood, how to use if/else conditions.

Implementation of if/elif/else condition

If , elif and else statements are a multiway decision taken by our programme due to certain conditions in our code.

Now we will write a programme, in which user will give the input as age and the programme will decide what would be the price of train ticket. If the input is age then the price will be printed.




Properties of Elif :-

1.) There can be any number of elif statements.
2.) Last state i.e. the else statement is only implemented if all elif fails to satisfies the condition.


So thats it in conditional expression rest depends on your practice. If you like this free of cost course then share it with your friends and help them in learning python.




                                                                           John Veer
                                              Contact mail id  -  john.veer.utube@gmail.com
                                                                  Thanks for reading !

Comments

Post a Comment

Popular posts from this blog

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

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

Bubble Sort Algorithm in PYTHON

What is Bubble Sort ? And why do we need this ? Bubble sort is the simplest algorithm to sort any array. Due to its simplicity, bubble sort is often used to introduce the concept of a sorting algorithm.  In computer graphics it is popular for its capability to detect a very small error (like swap of just two elements) in almost-sorted arrays and fix it with just linear complexity (2n). For example, it is used in a polygon filling algorithm, where bounding lines are sorted by their x coordinate at a specific scan line (a line parallel to x axis) and with incrementing y their order changes . ALGORITHM :- 1.) Firstly we have an unsorted list, which is to be sorted. 2.) Consider the first element of the list. Then compare it with the next element. 3.) If the second element is greator than the first element than swap them. 4.) If the second element is smaller than the first element, then we don't have to do anything. 5.) Going ahead, now after swap (may or may not), look for second...
Post a Comment
Read more