Data structure
Data structures are used to
store data in a computer in an organized fashion. Different types of data
structures are:-
Stack- Works in first in last out order. The element inserted first in stack is removed last.
Queue- First in First out order. The element inserted first is removed first.
Linked list- Stored data in a linear fashion.
Trees- Stores data in a non linear fashion with one root node and sub nodes.
Stack- Works in first in last out order. The element inserted first in stack is removed last.
Queue- First in First out order. The element inserted first is removed first.
Linked list- Stored data in a linear fashion.
Trees- Stores data in a non linear fashion with one root node and sub nodes.
What is a data
structure? What are the types of data structures?
The scheme of organizing related information is known as
‘data structure’.
The types of data structure are:
Lists: A group of similar items with connectivity to the previous or/and next data items.
Arrays: A set of homogeneous values
Records: A set of fields, where each field consists of data belongs to one data type.
Trees: A data structure where the data is organized in a hierarchical structure. This type of data structure follows the sorted order of insertion, deletion and modification of data items.
Tables: Data is persisted in the form of rows and columns. These are similar to records, where the result or manipulation of data is reflected for the whole table.
The types of data structure are:
Lists: A group of similar items with connectivity to the previous or/and next data items.
Arrays: A set of homogeneous values
Records: A set of fields, where each field consists of data belongs to one data type.
Trees: A data structure where the data is organized in a hierarchical structure. This type of data structure follows the sorted order of insertion, deletion and modification of data items.
Tables: Data is persisted in the form of rows and columns. These are similar to records, where the result or manipulation of data is reflected for the whole table.
Linear data structure: A linear
data structure traverses the data elements sequentially, in which only one data
element can directly be reached. Ex: Arrays, Linked Lists
Non-Linear data structure: Every data item is attached to several other data items in a way that is specific for reflecting relationships. The data items are not arranged in a sequential structure. Ex: Trees, Graphs
Non-Linear data structure: Every data item is attached to several other data items in a way that is specific for reflecting relationships. The data items are not arranged in a sequential structure. Ex: Trees, Graphs
What is a matrix?
Explain its uses with an example
Matrix is a way to store data
in an organized form in the form of rows and columns. Matrices are usually used
in computer graphics to project 3-dimensional space onto a 2-dimensional
screen. Matrices in the form of arrays are used to store data in an organized
form.
What is a matrix?
Explain its uses with an example
A matrix is a representation of certain rows and columns, to
persist homogeneous data. It can also be called as double-dimensioned array.
Uses:
- To represent class hierarchy using Boolean square matrix
- For data encryption and decryption
- To represent traffic flow and plumbing in a network
- To implement graph theory of node representation
Uses:
- To represent class hierarchy using Boolean square matrix
- For data encryption and decryption
- To represent traffic flow and plumbing in a network
- To implement graph theory of node representation
Comments