A data structure whose elements form a sequence is known as
TED
Answers
Answer:
The commonly used Data Structures can be broadly classified into two categories: Linear Data Structures: A data structure is said to be linear if its elements form a sequence or a linear list. For Example Array, Linked List, Stack, Queue.
Answer:
elements of the data structure forms a sequence of list then it is called as a. Linear data structure. b. Non-primitive data structure.
The commonly used Data Structures can be broadly classified into two categories: Linear Data Structures: A data structure is said to be linear if its elements form a sequence or a linear list.
Explanation:
A sequence is logically composed of three things: an array of elements, a maximum number of elements that the array may contain (i.e. its allocated size), and a logical length indicating how many of the allocated elements are valid.
Linear Data Structure
It is a type of data structure where data is stored and managed in a linear sequence.
Data elements in the sequence are linked to one after the other.
Implementation of the linear structure of data in a computer's memory is easy as the data is organized sequentially.
Array, queue.
Non-primitive data structure
is a type of data structure that can store the data of more than one type. Examples of primitive data structure are integer, character, float. Examples of non-primitive data structure are Array, Linked list, stack. Primitive data structure will contain some value, i.e., it cannot be NULL.