Using Python as Calculator

In this tutorial, we will learn how we can use python programming language as a calculator. To learn this you should have knowledge of int, str, float:-

Int:- It is integer number like 2, 5, 0, -2 etc.

Str:- It is string means string like a, j, hello, my name etc.

Float:- It is the floating point number like 3.8776, 1.874, 0.176 etc.

So lets start with our first programme, which is addition of two numbers.

So, as we have seen above that the sentence in print command is printed as it is and at last the sum of two numbers is printed.

In our next programme, we will study other calculations like substraction , multiplication etc.

Now, we have enough knowledeg to play with basic calculations.

Now we will try to find square and square-root of the integers.

So, with the help of above programme we have learnt to calculate various types of calculation.

In the next post, we will learn about list, tuples, dictionary and sets.

Hope you like this tutorial. Thanks for reading.

John Veer

Contact Email - john.veer.utube@gmail.com

Suggest data structures if you want through the above email adress.

Comments

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 ...

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) ...

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...

Basic Python Programs

Search This Blog