Skip to main content

Automate What's App Messager in PYTHON

Why are we doing this ? 


Only for knowledge, because in this tutorial, we will learn about how we can give commands and open other applications or website and search without typing any word in the search bar or typing automatically.

To learn this, we should have knowledge of following libraries :-

1.) PyAutoGUI
2.) Webbrowser
3.) Time

We can install these libraries by just going into the terminal, as shown in the image :-




And by the same method, we can install 'webbrowser' and 'time' libraries
By just giving commands 'pip install webbrowser' and we don't have install time using pip because it is our standard library and is installed already along with python.

Now lets talk about their properties and working, so we can understand better.

1.) PyAutoGUI is cross-platform GUI automation module that works on Python 2 & 3. You can control the mouse and keyboard as well as perform basic image recognition to automate tasks on your computer.

2.) Webbrowser module provides a high level interface which allows to display web based documents and webpages. The webbrowser module can be used to launch a browser and particular website.

3.) The Time library in python is used to obtain time in the real world and can perform various tasks related to it. The time module come packaged with python and no need to install using pip.


Now lets see its code :-



So thats it for this tutorial, Hope you like this tutorial, In the next tutorial, we will cover about Loops (while loop and for loop). If you like this tutorial, then share it with your friends, and help them to learn python.




John Veer
Contact mail id - john.veer.utube@gmail.com
Thanks for reading !
Contact us on the above mail or in the Contact Us section.

Comments

Post a Comment

Popular posts from this blog

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

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

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 ...
1 comment
Read more