Data Structure| Circular linked list| Stack balance| adjacency matrix| Binary| Insertion| Hashing| Extraction| Spanning tree| Selection

 Hello reader's and welcome to our blog, 

Today we are going to see about "Data structure", so first of all what is data structure?

" A data structure is a specialized format for organizing, processing, retrieving and storing data." 

There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways. 

Circular linked list - "A circular linked list is a type of linked list in which the first and the last nodes are also connected to each other to form a circle." 

 Stack balance - "Balance of Stack means the portion of an electrolyzer system comprising the megavolt transformer, rectifier, de-ionized water circuit, and including all associated controls and software." 

 adjacency matrix - "The adjacency matrix, also called the connection matrix, is a matrix containing rows and columns which is used to represent a simple labelled graph, with 0 or 1 in the position of (Vi , Vj) according to the condition whether Vi and Vj are adjacent or not."  

Binary search - "Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item, until you've narrowed down the possible locations to just one."  

Insertion sort - "Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the correct position in the sorted part." 

Hashing - "Hashing is the process of transforming any given key or a string of characters into another value."  

Extraction - "Data extraction is the process of collecting or retrieving disparate types of data from a variety of sources, many of which may be poorly organized or completely unstructured." 

Spanning tree - "A spanning tree is a sub-graph of an undirected connected graph, which includes all the vertices of the graph with a minimum possible number of edges. If a vertex is missed, then it is not a spanning tree. The edges may or may not have weights assigned to them." 

Selection - "Selection sort is a simple sorting algorithm. This sorting algorithm is an in-place comparison-based algorithm in which the list is divided into two parts, the sorted part at the left end and the unsorted part at the right end. Initially, the sorted part is empty and the unsorted part is the entire list."  

To download all these practical's and many more practical's related to data structure ......

Click here.....