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

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