Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing Applications of trees in data structures Binary Tree Implementation Using Arrays Convert a Binary Tree into a Binary Search Tree Create a binary search tree Horizontal and Vertical Scaling Invert binary tree LCA of binary tree Linked List Representation of Binary Tree Optimal binary search tree in DSA Serialize and Deserialize a Binary Tree Tree terminology in Data structures Vertical Order Traversal of Binary Tree What is a Height-Balanced Tree in Data Structure Convert binary tree to a doubly linked list Fundamental of Algorithms Introduction and Implementation of Bloom Filter Optimal binary search tree using dynamic programming Right side view of binary tree Symmetric binary tree Trim a binary search tree What is a Sparse Matrix in Data Structure What is a Tree in Terms of a Graph What is the Use of Segment Trees in Data Structure What Should We Learn First Trees or Graphs in Data Structures All About Minimum Cost Spanning Trees in Data Structure Convert Binary Tree into a Threaded Binary Tree Difference between Structured and Object-Oriented Analysis FLEX (Fast Lexical Analyzer Generator) Object-Oriented Analysis and Design Sum of Nodes in a Binary Tree What are the types of Trees in Data Structure What is a 2-3 Tree in Data Structure What is a Spanning Tree in Data Structure What is an AVL Tree in Data Structure Given a Binary Tree, Check if it's balanced B Tree in Data Structure Convert Sorted List to Binary Search Tree Flattening a Linked List Given a Perfect Binary Tree, Reverse Alternate Levels Left View of Binary Tree What are Forest Trees in Data Structure Compare Balanced Binary Tree and Complete Binary Tree Diameter of a Binary Tree Given a Binary Tree Check the Zig Zag Traversal Given a Binary Tree Print the Shortest Path Given a Binary Tree Return All Root To Leaf Paths Given a Binary Tree Swap Nodes at K Height Given a Binary Tree Find Its Minimum Depth Given a Binary Tree Print the Pre Order Traversal in Recursive Given a Generate all Structurally Unique Binary Search Trees Perfect Binary Tree Threaded Binary Trees Function to Create a Copy of Binary Search Tree Function to Delete a Leaf Node from a Binary Tree Function to Insert a Node in a Binary Search Tree Given Two Binary Trees, Check if it is Symmetric A Full Binary Tree with n Nodes Applications of Different Linked Lists in Data Structure B+ Tree in Data Structure Construction of B tree in Data Structure Difference between B-tree and Binary Tree Finding Rank in a Binary Search Tree Finding the Maximum Element in a Binary Tree Finding the Minimum and Maximum Value of a Binary Tree Finding the Sum of All Paths in a Binary Tree Time Complexity of Selection Sort in Data Structure How to get Better in Data Structures and Algorithms Binary Tree Leaf Nodes Classification of Data Structure Difference between Static and Dynamic Data Structure Find the Union and Intersection of the Binary Search Tree Find the Vertical Next in a Binary Tree Finding a Deadlock in a Binary Search Tree Finding all Node of k Distance in a Binary Tree Finding Diagonal Sum in a Binary Tree Finding Diagonal Traversal of The Binary Tree Finding In-Order Successor Binary Tree Finding the gcd of Each Sibling of the Binary Tree Greedy Algorithm in Data Structure How to Calculate Space Complexity in Data Structure How to find missing numbers in an Array Kth Ancestor Node of Binary Tree Minimum Depth Binary Tree Mirror Binary Tree in Data Structure Red-Black Tree Insertion Binary Tree to Mirror Image in Data Structure Calculating the Height of a Binary Search Tree in Data Structure Characteristics of Binary Tree in Data Structure Create a Complete Binary Tree from its Linked List Field in Tree Data Structure Find a Specified Element in a binary Search Tree Find Descendant in Tree Data Structure Find Siblings in a Binary Tree Given as an Array Find the Height of a Node in a Binary Tree Find the Second-Largest Element in a Binary Tree Find the Successor Predecessor of a Binary Search Tree Forest of a Tree in Data Structure In Order Traversal of Threaded Binary Tree Introduction to Huffman Coding Limitations of a Binary Search Tree Link State Routing Algorithm in Data Structure Map Reduce Algorithm for Binary Search Tree in Data Structure Non-Binary Tree in Data Structure Quadratic Probing Example in Hashing Scope and Lifetime of Variables in Data Structure Separate Chaining in Data Structure What is Dynamic Data Structure Separate Chaining vs Open Addressing Time and Space Complexity of Linear Data Structures Abstract Data Types in Data Structures Binary Tree to Single Linked List Count the Number of Nodes in the Binary Tree Count Total No. of Ancestors in a Binary Search Tree Elements of Dynamic Programming in Data Structures Find cost of tree with prims algorithm in data structures Find Preorder Successor in a Threaded Binary Tree Find Prime Nodes Sum Count in Non-Binary Tree Find the Right Sibling of a Binary Tree with Parent Pointers Find the Width of the Binary Search Tree Forest trees in Data Structures Free Tree in Data Structures Frequently asked questions in Tree Data Structures Infix, Postfix and Prefix Conversion Time Complexity of Fibonacci Series What is Weighted Graph in Data Structure
What is a Sparse Matrix in Data Structure?
2022-11-12 23:31:59

What is a Sparse Matrix in Data Structure?

Definition

A matrix in which a few non-zero elements are present is called a Sparse matrix. In a Sparse matrix, almost all the matrices are filled with zero (0). A matrix that contains m * n dimensions is treated as a 2-D array where n represents the number of columns and m represents the number of rows. A matrix is called a Sparse matrix when the number of non-zero elements in the given matrix is more significant in count than the number of zero elements present in the respective matrix.

If the matrix is extensive and the number of non-zero elements is much less in the count, then a lot of memory and space is wasted in such cases. Also, it can take a lot of time to scan the respective non-zero element.

Syntax

Rather than storing fewer non-zero elements, we use two representations to limit space usage and processing time in a matrix. The mentioned two representations are stated below:

  1. Array representation
    In the array representation of a sparse matrix, we convert a 2 – D array into a 1 – D array. The converted array contains three columns, among which represent the following:
    1. Row – The sparse matrix represents the index of the row of the given non-zero element.
    2. Column - The sparse matrix represents the index of the column of the given non-zero element.
    3. Value - The sparse matrix represents the value of the non-zero elements in the same row of the given column index in the allotted 2 – D matrix.
  2. Linked list representation
    Each node has four fields in the linked list representing a sparse matrix. The four fields are stated below:
    1. Row – The sparse matrix represents the index of the row of the given non-zero element.
    2. Column - The sparse matrix represents the index of the column of the given non-zero element.
    3. Value – In a sparse matrix, it represents the value of the respective non-zero element at (r, c), where r represents the index of the row of the non-zero element and c represents the index of the column of the non-zero element.
    4. Next node – A sparse matrix represents the reference to the next node considering the given node.

The working of Sparse matrix in data structures

The sparse matrix can be expressed as a two-dimensional matrix in which the count of non-zero elements is much less than the count of zero elements present in the respective two-dimensional matrix. If the given matrix is extensive and the number of non-zero elements is much less in the count, then a lot of memory and space is wasted in such cases. Also, it can take a lot of time to scan the respective non-zero element. The problem of loss in space is caused due to the storage of zeros in the two-dimensional matrix.

When it comes to Sparse matrices, they are used to store the non-zero elements present in the two-dimensional matrices. By using Sparse matrices, we can avoid the problems caused by storing these matrices with significant zero elements and a few non-zero elements (these problems include wastage of space and colossal processing time). Sparse matrices store only the non-zero elements in the given two-dimensional matrix. Hence, they solve the problem of wastage of memory and space that is caused due to the storage of the zero elements in the regular two-dimensional matrices. The processing time in finding a given non-zero element in matrices having large dimensions is also reduced by storing them in the sparse matrices.

Rather than storing fewer non-zero elements, we use two representations to limit space usage and processing time in a matrix. The mentioned two representations are stated below:

  1. Array representation
    In the array representation of a sparse matrix, we convert a 2 – D array into a 1 – D array.
    An array representation in a Sparse matrix is often used when accessing the elements is done more frequently. As arrays store elements based on indices, this representation is helpful in such scenarios.
    The converted array of the array representation of a Sparse tree contains three columns, among which each represents the following:
    1. Row – The sparse matrix represents the index of the row of the given non-zero element.
    2. Column - The sparse matrix represents the index of the column of the given non-zero element.
    3. Value - The sparse matrix represents the value of the non-zero elements in the same row of the given column index in the allotted 2 – D matrix.
  2. Linked list representation
    Each node has four fields in the linked list representing a sparse matrix. A linked list representation is used in a Sparse matrix in the cases where we perform the operations of insertion and deletion elements very frequently on the matrix. As the insertion and deletion operations are more accessible to serve on a linked list rather than an array, this representation is instrumental in these scenarios.
    The four fields of linked list representation of a sparse tree are stated below:
    1. Row – The sparse matrix represents the index of the row of the given non-zero element.
    2. Column - The sparse matrix represents the index of the column of the given non-zero element.
    3. Value – In a sparse matrix, it represents the value of the respective non-zero element at (r, c), where r represents the index of the row of the non-zero element and c represents the index of the column of the non-zero element.
    4. Next node – A sparse matrix represents the reference to the next node considering the given node.

Example of Sparse matrix

A sparse matrix representation can be explained by the example stated below. The below-mentioned two-dimensional matrix contains five rows and eight columns.

What is a Sparse Matrix in Data Structure

We can observe that we have eight (8) non-zero elements among all the (8 * 5 = 40) forty elements present in the two-dimensional matrix. This means that it is enough if we store the eight non-zero elements in the memory. As the rest of the elements are zero elements, they can be ignored.

We know that we can represent the given matrix as a sparse matrix in two different ways:

  1. Array representation
    Step -1: Make a list of the non-zero elements in the given two-dimensional matrix, along with their column and row indices.
    Step -2: Create an array having:
    1. Rows = count of non-zero elements
    2. Column = (Row, column, value) 3
      Step – 3: Fill the non-zero elements into the array
What is a Sparse Matrix in Data Structure

Advantages of Array list representation of Sparse matrix

An array representation in a Sparse matrix is often used when accessing the elements is done more frequently. As arrays store elements based on indices, this representation is helpful in such scenarios.

Array list representation of Sparse matrices is better in the location of elements compared to linked lists representation of sparse matrices as the elements are stored based on indices in the array list representation of the Sparse matrices.

  • Linked list representation
What is a Sparse Matrix in Data Structure

Advantages of linked list representation of Sparse matrix

Each node has four fields in the linked list representing a sparse matrix. A linked list representation is used in a Sparse matrix in the cases where we perform the operations of insertion and deletion elements very frequently on the matrix. As the insertion and deletion operations are more accessible to serve on a linked list rather than an array, this representation is instrumental in these scenarios.