Data Structures Notes

Hashing is the process of mapping large amount of data item to a smaller table with the help of a hashing function . The essence of hashing...

The Dijkstra's algorithm entails the following procedure: - The breath-first approach is used to traversal the network, however the diff...

Network refers to a graph in which the edges are bound with weights. Here weights can be numbers assigned to a the edges. Hence, a graph of ...

There are two possible traversal methods for a graph: i. Breadth-First Traversal ii. Depth-First Traversal i. Breadth-First Traversal : Tra...

There two types of graphs: i. Undirected Graphs ii. Directed Graphs Undirected Graph : A graph that entail edges with ordered pair of vertic...

Graph is an Abstract Data Type ( ADT ) which is of a non-linear structure entailing sets of nodes and connectors. Here, the connectors helps...

Bucket Sort (alternatively know as bin sort) is an algorithm that sorts numbers and comes under the category of distribution sort. This sort...