COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
Static or dynamic
|
|
Linear or non-linear
|
|
Homogeneous or non-homogeneous
|
|
None of the above
|
Detailed explanation-1: -In linear data structure, data elements are sequentially connected and each element is traversable through a single run. In non-linear data structure, data elements are hierarchically connected and are present at various levels. In linear data structure, all data elements are present at a single level.
Detailed explanation-2: -It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.
Detailed explanation-3: -Characteristics of a data structure There are three main characteristics: Correctness. Time complexity. Space complexity.
Detailed explanation-4: -Data structures where data elements are not arranged sequentially or linearly are called non-linear data structures. In a non-linear data structure, single level is not involved. Therefore, we can’t traverse all the elements in single run only.