# Data Structures :: Arrays

Home > Technical Aptitude > Data Structures > Arrays > General Questions

NA
SHSTTON
120
Solv. Corr.
31
Solv. In. Corr.
151
Attempted
0 M:32 S
Avg. Time

1 / 76

Choose the correct option.

The smallest element of an array's index is called its

Alower bound.

Bupper bound.

Crange.

Dextraction.

| | | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
61
Solv. Corr.
133
Solv. In. Corr.
194
Attempted
0 M:21 S
Avg. Time

2 / 76

Choose the correct option.

The extra key inserted at the end of the array is called a,

AEnd key.

BStop key.

CSentinel.

DTransposition.

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
142
Solv. Corr.
45
Solv. In. Corr.
187
Attempted
0 M:0 S
Avg. Time

3 / 76

Choose the correct option.

The largest element of an array index is called its

Alower bound.

Brange.

Cupper bound.

DAll of these.

| | | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
69
Solv. Corr.
103
Solv. In. Corr.
172
Attempted
0 M:0 S
Avg. Time

4 / 76

Choose the correct option.

Each array declaration need not give, implicitly or explicitly, the information about

Athe name of array

Bthe data type of array

Cthe first data from the set to be stored

Dthe index set of the array

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
77
Solv. Corr.
81
Solv. In. Corr.
158
Attempted
0 M:54 S
Avg. Time

5 / 76

Choose the correct option.

The elements of an array are stored successively in memory cells because

Aby this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

Bthe architecture of computer memory does not allow arrays to store other than serially

Cboth of above

Dnone of above

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
64
Solv. Corr.
69
Solv. In. Corr.
133
Attempted
0 M:41 S
Avg. Time

6 / 76

What does the following function do if S is an array used to implement a stack.
float peep (float S[], int *t, int i)
{
float val;
if( (*t-i+1) > 0)
{
val = S[*t-i+1];
return val;
}
} ?

AReturns the ith value from top of the stack

BReturns the value at the top of the stack

CIt gives a compilation error

DReturns the value at the ith postion of the array

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
59
Solv. Corr.
70
Solv. In. Corr.
129
Attempted
0 M:25 S
Avg. Time

7 / 76

Choose the correct option.

You want to find the nth element of a set of numbers. If you store the numbers in

AFinding the nth element is slower if it was stored in an array

BFinding the nth element is faster if it was stored in an array

CFinding the nth element takes the same amount of time across all data structures

DFinding the nth element is slower if it was stored in a hash table

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
81
Solv. Corr.
67
Solv. In. Corr.
148
Attempted
0 M:0 S
Avg. Time

8 / 76

Choose the correct option.

Arrays are best data structures

Afor relatively permanent collections of data

Bfor the size of the structure and the data in the structure are constantly changing

Cfor both of above situation

Dfor none of above situation

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
123
Solv. Corr.
17
Solv. In. Corr.
140
Attempted
0 M:0 S
Avg. Time

9 / 76

Choose the correct option.

Arrays are best data structures for

Arelatively permanent collections of data

Bthe size of the structure and the data in the structure are constantly changing

Cboth of above situation

Dnone of above situation

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
26
Solv. Corr.
129
Solv. In. Corr.
155
Attempted
0 M:0 S
Avg. Time

10 / 76

Choose the correct option.

Two dimensional arrays are also called

Atables arrays

Bmatrix arrays

Cboth of the above

Dnone of the above

Explanation:

Here is no explanation for this answer

Workspace