Arrays allow random access and cache friendliness due to contiguous memory allocation.

Arrays allow efficient insertions and deletions in the middle.

Arrays provide low memory usage by storing references instead of actual data.

Arrays are slower than other data structures in accessing elements.

-1

1

0

None of the Above

Sequential

Random

Logarithmic

Alternative

Each element is stored at a random memory location.

All elements are stored in a contiguous block of memory.

Arrays are stored in reverse order.

Elements are dynamically linked to the next element in memory.

Data structures like queue or stack cannot be implemented

There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

Index value of an array can be negative

Elements are sequentially accessed

Each element is stored at a random memory location.

Elements are dynamically linked to the next element in memory.

Each element is stored in a contiguous memory locations

Elements are grouped and each group is stored at a random memory location .

Declaring an array specifies its size, while initialization gives it values

Initialization creates an empty array, and declaration assigns values to it

Declaring an array also initializes it to default values

There is no difference between declaring and initializing an array

An array where each element is a single value.

An array that stores elements is a single row.

an array of arrays or a matrix consisting of rows and columns.

An array that contains only integers.

array(i, j)

array[i, j]

array[ i ][ j ]

array{ i }{ j }

O(1)

O(N log N)

O(log N)

O(N)