Real-time application of Data Structures

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time applications of all the data structures are discussed.

Application of Arrays:

Arrays are the simplest data structures that stores items of the same data type. A basic application of Arrays can be storing data in tabular format. For example, if we wish to store the contacts on our phone, then the software will simply place all our contacts in an array.

Some other applications of the arrays are:

  1. Arrangement of leader-board of a game can be done simply through arrays to store the score and arrange them in descending order to clearly make out the rank of each player in the game.
  2. A simple question Paper is an array of numbered questions with each of them assigned to some marks.
  3. 2D arrays, commonly known as, matrix, are used in image processing.
  4. It is also used in speech processing, in which each speech signal is an array.

Application of Linked Lists:

A linked list is a sequence data structure, which connects elements, called nodes, through links.

Some other applications of the linked list are:

  1. Images are linked with each other. So, an image viewer software uses a linked list to view the previous and the next images using the previous and next buttons.
  2. Web pages can be accessed using the previous and the next URL links which are linked using linked list.
  3. The music players also use the same technique to switch between music.
  4. To keep the track of turns in a multi player game, a circular linked list is used.

Application of Stack:

A stack is a data structure which uses LIFO order.

Some Applications of a stack are:

  1. Converting infix to postfix expressions.
  2. Undo operation is also carried out through stacks.
  3. Syntaxes in languages are parsed using stacks.
  4. It is used in many virtual machines like JVM.

Application of Queue:

A queue is a data structure which uses FIFO order.

Some applications of a queue are:

  1. Operating System uses queue for job scheduling.
  2. To handle congestion in networking queue can be used.
  3. Data packets in communication are arranged in queue format.

Application of Graph:

Graph is a data structure where data is stored in a collection of interconnected vertices (nodes) and edges (paths).

Some applications of a graph are:

  1. Facebook’s Graph API uses the structure of Graphs.
  2. Google’s Knowledge Graph also has to do something with Graph.
  3. Dijkstra algorithm or the shortest path first algorithm also uses graph structure to finding the smallest path between the nodes of the graph.
  4. GPS navigation system also uses shortest path APIs.

Application of Tree:

Trees are hierarchical structures having a single root node.

Some applications of the trees are:

  1. XML Parser uses tree algorithms.
  2. Decision-based algorithm is used in machine learning which works upon the algorithm of tree.
  3. Databases also uses tree data structures for indexing.
  4. Domain Name Server(DNS) also uses tree structures.

Application of Hash Tables:

Hash Tables are store data in key-value pairs. It only stores data which has a key associated with it. Inserting and Searching operations are easily manageable while using Hash Tables.

Some applications of a hashtable are:

  1. Data stored in databases is generally of the key-value format which is done through hash tables.
  2. Every time we type something to be searched in google chrome or other browsers, it generates the desired output based on the principle of hashing.
  3. Message Digest, a function of cryptography also uses hashing for creating output in such a manner that reaching to the original input from that generated output is almost next to impossible.
  4. In our computers we have various files stored in it, each file has two very crucial information that is, filename and file path, in order to make a connection between the filename to its corresponding file path hash tables are used.

Application of Heap:

A Heap is a special case of a binary tree where the parent nodes are compared to their children with their values and are arranged accordingly.

Some applications of heaps are:

  1. In heapsort Algorithm, which is an algorithm for sorting elements in either min heap(the key of the parent is less than or equal to those of its children) or max heap(the key of the parent is greater than or equal to those of its children), sorting is done with the creation of heaps.
  2. Heaps are used to implement a priority queue where priority is based on the order of heap created.
  3. Systems concerned with security and embedded system such as Linux Kernel uses Heap Sort because of the O( n log(n) ).
  4. If we are stuck in finding the Kthsmallest (or largest) value of a number then heaps can solve the problem in an easy and fast manner.

Application of Matrix:

Matrix is an ordered collection of columns and rows of elements. It is necessary to enclose the elements of a matrix within the brackets.

Some applications of a matrix are:

  1. In geology, matrices are used for making seismic surveys.
  2. Used for plotting graphs, statistics and also to do scientific studies and research in almost different fields.
  3. Matrices are also used in representing the real-world data’s like the population of people, infant mortality rate, etc.
  4. They are best representation methods for plotting surveys.

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.