COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Stacks, Queues, Linked list
|
|
|
int, float, complex
|
|
|
Operators, tokens, punctuators
|
|
|
Tree, graph
|
Detailed explanation-1: -A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc. There are two ways of representing linear data structures in memory.
Detailed explanation-2: -Linear data structure examples are array, linked list, stack, queue, etc.
Detailed explanation-3: -A linked list is a linear data structure that stores a collection of data elements dynamically.
Detailed explanation-4: -A stack is a linear data structure that stores data elements in a Last-In/First-Out (LIFO) or First-In/Last-Out (FILO) order.
Detailed explanation-5: -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.