# Basic CS-Data Structures [3i Infotech Placement]: Sample Questions 39 - 40 of 52

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

## Question 39

Data Structures

Edit

### Describe in Detail

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

### Explanation

## Sparse Matrix

- Matrix is a two-dimensional data object made of m rows and n columns, so total values.
- If most of the elements of the matrix have 0 or NULL values it is called a sparse matrix.
**Use of sparse matrix**:- Storage:
- There are less non-zero elements than zeros and thus less memory to only store those elements (with their positions) .

- Computing time:
- Saved by logically designing a data structure traversing only non-zero elements.

- Storage:
- Sparse Matrix Representations can be done many ways for example:
- Array representation
- Linked list representation

## Index Generation

- The collected data must include grouped and sorted index entries.
- This data can be used to generate output specific indexes, back-of-the-book indexes for print, navigation trees in online outputs and so on.

## Question 40

Data Structures

### Explanation

- According to access- listed list is a linear data structure.
- According to storage linked list is a non-linear data structure as each node can be stored independently.

## Linear Data Structure

- Traverses the data elements sequentially, in which only one data element can directly be reached, Eg: Arrays, Linked Lists

## Non-Linear Data Structure

- Every data item is attached to several other data items that is specific for reflecting relationships.
- The data items are not arranged in a sequential structure for example, Trees, Graphs