COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
linear
|
|
|
non linear
|
|
|
both a and b
|
|
|
all of above
|
Detailed explanation-1: -Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved. Therefore, we can traverse all the elements in single run only.
Detailed explanation-2: -Stacks, Queues, Arrays, and Linked lists are all examples of linear data structures.
Detailed explanation-3: -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.