## Prims Algorithm in Data Structure

What is Prims Algorithm? It is a greedy algorithm. It starts with an empty spanning tree. The idea is to maintain the two sets of the vertices: Contain vertices already included in MST.

## Rat in A Maze Problem Algorithm and Flowchart

What is Rat in A maze Problem? In this problem the Maze is described by the NxN binary matrix of the blocks where the source block is the upper leftmost block that is the maze[0][0] and destination block is always lower at the rightmost block that is the maze at [N-1][N-1]. A rat starts from source point and has to reach the desired destination. The rat can move only in two directions i.e forward and down.

## M Coloring Problem Backtracking Algorithm

What is M Coloring Backtracking Algorithm? In this problem, an undirected graph is given. There is also provided m colors. The problem is to find if it is possible to assign nodes with m different colors, such that no two adjacent vertices of the graph are of the same colors. If there exists a solution, then display which color is assigned on which vertex.

## Implementation of Stack using Queue Algorithm and Flowchart

The problem is opposite of this post. We are given a stack data structure with a push and pop operations, the task is to implement a queue using instances of stack data structure and operations on them.

## Quick Sort Algorithm and Flowchart with implementation in Java

Quick Sort Algorithm is an algorithm of the type Divide & Conquer. Divide stands for : Rearranging the elements and split arrays into two sub-arrays and an element in between search that each element in left sub array is less than or equal to the average element and each element in the right sub- array is larger than the middle element.

## Huffman's Coding Greedy Algorithm

The prefix codes, means the codes (bit sequences) which are assigned in such a way that the code assigned to one character is not the prefix of code assigned to any other character. This is how the Huffman Coding makes sure that there is no ambiguity when decoding the generated bitstream.

## Floyd Warshalls Algorithm

Let the vertices of G be V = {1, 2........n} and consider a subset {1, 2........k} of vertices for some k. For any pair of vertices i, j ? V, considered all paths from i to j whose intermediate vertices are all drawn from {1, 2.......k}, and let p be a minimum weight path from amongst them. The Floyd-Warshall algorithm is known to exploits a link between path p and shortest paths from i to j with all intermediate vertices in the set {1, 2.......k-1}. The link depends on whether or not k is an intermediate between vertex of path p.

## Double Hashing Algorithm

Double hashing is a collision resolving technique in Open Addressed Hash tables. Double hashing uses the idea of applying a second hash function to key when a collision occurs.Double Hashing is one of the best techniques available for open addressing because the permutations produced have many of the characteristics of randomly chosen permutations.

##### Need Help?

Looking for any Software or Tutorial?
Don't Worry, we will find it for you
Contact Now