Graph traversal is a technique to visit the each nodes of a graph G. It is also use to calculate the order of vertices in traverse process. We visit all the nodes starting from one node which is connected to each other without going into loop. Basically in graph it may happen some time visiters … Read more
DFS stands for Depth First Search, is one of the graph traversal algorithms that uses Stack data structure. In DFS Traversal go as deep as possible of the graph and then backtrack once reached a vertex that has all its adjacent vertices already visited. Depth First Search (DFS) algorithm traverses a graph in a depthward … Read more
Breadth-first search graph traversal techniques use a queue data structure as an auxiliary data structure to store nodes for further processing. The size of the queue will be the maximum total number of vertices in the graph. It is a smart way to look through data organized in a graph. A graph is a collection … Read more
A graph is a non-linear data structure that consists of vertices and edges.Vertices are also known as nodes. Edges can be in order or not. An ordered pair (u, v) indicates that there is an edge from vertex u to vertex v in a directed graph. Also in directed graph (u,v) is not equal to … Read more
A graph is an abstract data structure that is basically a collection of a finite set of vertices (also called nodes) and edges that connect these vertices. A Graph is also known as a non-linear data structure because we can insert data anywhere by following some defined rule anywhere. Definition We can define graph G … Read more
Q1). What is pep8 in Python? why pep8 is important? Ans: PEP stands for Python Enhancement Proposal. We can Spell pep8 as PEP8 or PEP-8. It is a document that provides Guideline to improve the readability of Python Code. It was written by Guido van Rossum, Barry Warsaw, and Nick Coghlan in 2001. It was … Read more
One of the most important areas you should have a focus on when you are preparing for the interview for position of python developer, is a pattern printing program using python. I don’t think that in an interview if your recruiter is recruiting you as a software developer/software engineering profile will not ask to write … Read more
An AVL tree is a self-balancing binary search tree. It was named AVL on its inventor Adelson-Velsky and Landis. There are some scenarios in the Binary search tree where complexity can go O(n) in the worst-case search. so to get search in O(log n) in worst case AVL tree is designed. Property of AVL tree … Read more
Radix sort is a non-comparative sorting algorithm that sorts elements digit by digit starting from least significant digit to most significant digit. It commonly uses Counting Sort or, less frequently, Bucket Sort, as a stable intermediate sorting technique for each digit pass Suppose if you want to sort 10 elements in ascending order using radix sort, first sort the digit of unit … Read more
Quick Sort is a very popular sorting algorithm also known as partition exchange sort. Quick sort follows divide-and-conquer strategy to sort an array elements. In this algorithm first we select the pivot element. This pivot element can be selected either the left most element or right most element. After selecting pivot element, first divide an … Read more