COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Element
|
|
|
Array
|
|
|
Index
|
|
|
None of the above
|
Detailed explanation-1: -Array is a container which can hold a fix number of items and these items should be of the same type. Most of the data structures make use of arrays to implement their algorithms. Following are the important terms to understand the concept of Array. Element − Each item stored in an array is called an element.
Detailed explanation-2: -Arrays a kind of data structure that can store a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type.
Detailed explanation-3: -An array is a container object that holds a fixed number of values of a single type. The length of an array is established when the array is created.
Detailed explanation-4: -Explanation: Stack data structure is most suitable to implement redo-undo feature. This is because the stack is implemented with LIFO(last in first out) order which is equivalent to redo-undo feature i.e. the last re-do is undo first.
Detailed explanation-5: -There are different data structures based on hashing, but the most commonly used data structure is the hash table. Hash tables are generally implemented using arrays.