Data Structure MCQ - Array

1. The Array shows a hierarchical structure.
2. Arrays are immutable.
3. Container that stores the elements of similar types
4. The Array is not a data structure

1. Elements of mixed data types can be stored.
2. Easier to access the elements in an array
3. Index of the first element starts from 1.
4. Elements of an array cannot be sorted

1. Binary Search tree
2. Caching
3. Spatial locality
4. Scheduling of Processes

1. 9
2. 36
3. 35
4. None of the above

#include   
int main()  
{  
   int arr[5]={10,20,30,40,50};  
   printf("%d", arr[5]);  
  
    return 0;  
}  

1. Garbage value
2. 10
3. 50
4. None of the above

1. int arr[2]=(10, 20)
2. int arr(2)={10, 20}
3. int arr[2] = {10, 20}
4. int arr(2) = (10, 20)

1. Stack and Queue data structures can be implemented through an array.
2. Index of the first element in an array can be negative
3. Wastage of memory if the elements inserted in an array are lesser than the allocated size
4. Elements can be accessed sequentially.

1. N-1
2. logN - 1
3. N + logN - 2
4. N

1. floor address
2. foundation address
3. first address
4. base address

1. 560
2. 565
3. 570
4. 575