Basic CS-Data Structures [TCS Placement]: Sample Questions 21 - 21 of 28

Get unlimited access to the best preparation resource for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 21

Data Structures

Describe in Detail


List out few of the applications that make use of multilinked structures?


Sparse matrix:- in computer programming, a matrix can be defined with a 2-dimensional array. Any array with ‘m’ column and ‘n’ rows represents a matrix. There may be situations in which a matrix contains more zero values than NON-ZERO values. Such matrix is known as sparse matrix.

Given the Image is Define the Example of Sparse Matrix
  • In above example matrix, there are only 6 non-zero elements (those are 9, 8,4, 2,5 and 2) and matrix size is .
  • Here the first row in the right side table is filled with values 5,6, & 6 which indicates that it is a sparse matrix with 5 rows, 6 columns, and 6 non-zero values.
  • Second row is filled with 0,4, & 9 which indicates the value in the matrix at 0th row, 4th column is 9.
  • In the same way the remaining non-zero values also follows the similar pattern.
  • This table can be stored in the multilinked structures.
  • Index Generation: In database systems, an index (IDX) data structure is defined on columns to speed data retrieval. An index is a small copy of a database table sorted by key values.
Given the Image is Define the Indexing Process

Developed by: