Skip to main content

First Python Programme

 If you are here, then I think you are a python enthusiast. On this website, we upload daily posts on new and basic programme for beginners. 

So let’s start with the first code i.e. Hello World programme. So first of all you you should know how to give print command in python.

To print we write print(“Hello World”). What’s inside the small brackets will be printed.
So the programme is :


So, as we can see above, when we implemented the print command, the thing between the small bracket is printed.

So let’s see some other examples
In this example, we will store an integer value in a variable. And then print the integer will the help,of that variable. So let’s get started

Another example
Now we will store a string into a variable and then print the string with the help of that variable




Hope you like this tutorial. Please go for the next post for next amazing tutorial on calculations such as addition, substractiom, multiplication, finding squares, cubes, square root and many such amazing newbie programme. Please share the weblink with yours friends who are python lovers like you.

John Veer


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