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

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

Quicksort Algorithm and Data structure in PYTHON

So, now what is Quicksort ? Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O comparisons to sort n items. In the worst case, it makes O comparisons, though this behavior is rare. Quicksort is often faster in practice than other O algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort is a comparison sort and, in efficient implementations, is not a stable sort. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only O additional space used by the stack during the recursion. Properties of Quicksort :- The quick sort is an in-place, divide-and-conquer, massively recursive sort algorithm . The efficiency of the algorithm is majorly impacted by which element is chosen as the pivot point. The worst-case efficiency of the quick sort is o (n²) when the list is sorted and left most element is chosen as the p...

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

Basic Python Programs

Search This Blog