COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
trees
|
|
|
linear
|
|
|
non-linear
|
|
|
graphs
|
Detailed explanation-1: -In this structure, the elements are arranged hierarchically or non-linear manner. Arrays, linked list, stack, queue are the types of a linear data structure. Trees and graphs are the types of a non-linear data structure.
Detailed explanation-2: -Array Data Structure In an array, elements in memory are arranged in continuous memory. All the elements of an array are of the same type. And, the type of elements that can be stored in the form of arrays is determined by the programming language.
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.
Detailed explanation-4: -Stack. A stack stores a collection of items in the linear order that operations are applied. This order could be last in, first out (LIFO) or first in, first out (FIFO).
Detailed explanation-5: -The types of structures following non-linearity are Trees and Graphs. A tree data structure consists of various nodes linked together.