Contains Different Type Of Sorting IN Data Structure such as –
Quick Sort
Heap Sort
Merge Sort
Shell Sort
ETC.
Click Below to Access Slides….
Category Archives: Theory
Sorting Technique – Bubble Sort, Selection Sort, Insertion Sort
This Post is all about Different types of Sorting Techniques used in Data Structures.
It Contains algorithms of
- Bubble Sort
- Selection Sort
- Insertion Sort
Click Below — to get access to slides —
Dijkstra Algorithm : PPT
DIJKSTRA (G, w, s)
- INITIALIZE SINGLE-SOURCE (G, s)
- S ← { } // S will ultimately contains vertices of final shortest-path weights from s
- Initialize priority queue Q i.e., Q ← V[G]
- while priority queue Q is not empty do
- u ← EXTRACT_MIN(Q) // Pull out new vertex
- S ← S È {u}
// Perform relaxation for each vertex v adjacent to u - for each vertex v in Adj[u] do
- Relax (u, v, w)
Above is the algorithm for dijkstra’s minimum path. Click below for more…
Minimum Spanning Tree : PPT
A subgraph that spans (reaches out to ) all vertices of a graph is called a spanning subgraph.
A subgraph that is a tree and that spans (reaches out to ) all vertices of the original graph is called a spanning tree.
Among all the spanning trees of a weighted and connected graph, the one (possibly more) with the least total weight is called a minimum spanning tree (MST).
Click Below For More
BELLMAN FORD ALGO : PPT
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
Click below to view more –
HUFFMAN CODING :PPT
Huffman coding is a coding technique for lossless compression of data base based upon the frequency of occurance of a symbol in that file.
In huffman coding every Data is based upon 0’s and 1’s which reduces the size of file.
Using binary representation, the number of bits required to represent each character depends upon the number of characters that have to be represented. Using one bit we can represent two characters, i.e., 0 represents the first character and 1 represents the second character.
Click Below for More – –
C#ODE Studio 