Python Articles

Page 854 of 855

Python Function to Check UNIX Passwords

Arjun Thakur
Arjun Thakur
Updated on 30-Jul-2019 756 Views

To verify UNIX password, we should use the crypt module. It has crypt(3) routine. It is basically one-way hash function based on the modified DES algorithm. To use the crypt module, we should import it using. import crypt Method crypt.crypt(word, salt) This method takes two arguments. The first one is the word and second one is salt. The word is basically the user password, which is given in the prompt. The salt is a random string. It is used to perturb the DES Algorithm in one of 4096 ways. The salt contains only Upper-case, Lower-case, Numeric values ...

Read More

Python Program to crawl a web page and get most frequent words

Samual Sam
Samual Sam
Updated on 30-Jul-2019 551 Views

Our task is to crawl a web page and count the frequency of the word. And ultimately retrieving most frequent words. First we are using request and beautiful soup module and with the help of these module creating web-crawler and extract data from web page and store in a list. Example code import requests from bs4 import BeautifulSoup import operator from collections import Counter def my_start(url): my_wordlist = [] my_source_code = requests.get(url).text my_soup = BeautifulSoup(my_source_code, 'html.parser') for each_text in my_soup.findAll('div', {'class':'entry-content'}): ...

Read More

Color game using Tkinter in Python

karthikeya Boyini
karthikeya Boyini
Updated on 30-Jul-2019 2K+ Views

For developing GUI applications tkinter is very popular and easy. Using tkinter easily develop GUI games. Here also we are trying to develop color game. In this game the player has to enter color of the word that appears on the screen and hence the score increases by one, the total time to play this game is 30 seconds and colors used in this game are Red, Blue, Green, Pink, Black, Yellow, Orange, White, Purple and Brown. The interface will display name of different colors in different colors. User has to identify the color and enter the correct color name ...

Read More

Python program to create a sorted merged list of two unsorted list

karthikeya Boyini
karthikeya Boyini
Updated on 30-Jul-2019 695 Views

Here two user input list is given, the elements of two lists are unsorted. Our task is to merged these two unsorted array and after that sort the list. Example Input: A [] = {100, 50, 150} B [] = {200, 30, 20} Output: Merge List:{20, 30, 50, 100, 150, 200} Algorithm Step 1: first we create two user input list. Step 2: Final merge list size is (size of the first list + the size of the second list). Step 3: then sort two list using sort() method. Step ...

Read More

Python program to count unset bits in a range.

Ankith Reddy
Ankith Reddy
Updated on 30-Jul-2019 295 Views

Given a positive a number and the range of the bits. Our task is to count unset bits in a range. Input : n = 50, starting address = 2, ending address = 5 Output : 2 There are '2' unset bits in the range 2 to 5. Algorithm Step 1 : convert n into its binary using bin(). Step 2 : remove first two characters. Step 3 : reverse string. Step 4 : count all unset bit '0' starting from index l-1 to r, where r is exclusive. Example Code # ...

Read More

Python Program to Cyclic Redundancy Check

Samual Sam
Samual Sam
Updated on 30-Jul-2019 8K+ Views

For detecting errors in digital data CRC is used, this is a good technique in detecting the transmission errors. In this technique mainly binary division is applied. In these technique, cyclic redundancy check bits are present which is a sequence of redundant bits, these bits are appended to the end of data unit so that the resulting data unit becomes exactly divisible by a second which is predetermined binary number. At the destination side, the incoming data is divided by the same number, if there is no remainder then assumed that data is correct and it’s ready to accept. A ...

Read More

Python Internet String Preparation

Ankith Reddy
Ankith Reddy
Updated on 30-Jul-2019 443 Views

To identify different things in the internet, it is necessary to compare different identification for equality. The comparison procedure depends on the application domain. For an example, some things are case-insensitive etc. To check these kind of information stringprep is used. The RFC 3454 defines the procedure to prepare the Unicode strings before transmitting through the wire. After going through the preparation procedure, they have a certain normalized form. The RFC defines a set of tables; these tables can be combined into profiles. For an example there is a profile of stringprep is nameprep. In the nameprep, there are internationalized ...

Read More

Stack and Queue in Python using queue Module

karthikeya Boyini
karthikeya Boyini
Updated on 30-Jul-2019 746 Views

In Python, it is very easy to implement stack and queue data structures. Stack is called LIFO because Stack works on the principle of "Last-in, first-out" and Queue is called FIFO because Queue works on the principle of "First-in, first-out", and the inbuilt functions in Python make the code shorter and simple. The Queue module implements multi-producer, multi-consumer queues and It is especially useful in threaded programming when information must be exchanged safely between multiple threads. The Queue class in this module implements all the required locking semantics and it depends on the availability of thread support in Python. This ...

Read More

What is possible key/value delimiter in Python dictionary?

Chandu yadav
Chandu yadav
Updated on 30-Jul-2019 546 Views

You can use any hashable object like int, string, etc as a key in a python dict. You need to separate it from the value using the ':' delimiter. The value can be any type of object. Consecutive key value pairs must be separated by a comma.

Read More

How do Python dictionary hash lookups work?

karthikeya Boyini
karthikeya Boyini
Updated on 30-Jul-2019 512 Views

Dicts are hash tables. No tree searching is used. Looking up a key is a nearly constant time(Amortized constant) operation, regardless of the size of the dict. It creates the hash of the key, then proceeds to find the location associated with the hashed value. If a collision listed address is encountered, it starts the collision resolution algorithm to find the actual value.This causes dictionaries to take up more space as they are sparse.

Read More
Showing 8531–8540 of 8,546 articles
Advertisements