data structures using points to remember an array is collection of elements of the same data type the elements of an array are stored in consecutive memory locations and are referenced by an index (also known as the subscriptthe index specifies an offset from the beginning of the array to the element being referenced declaring an array means specifying three parametersdata typenameand its size the length of an array is given by the number of elements stored in it there is no single function that can operate on all the elements of an array to access all the elementswe must use loop the name of an array is symbolic reference to the address of the first byte of the array thereforewhenever we use the array namewe are actually referring to the first byte of that array considers two-dimensional array as an array of one-dimensional arrays two-dimensional array is specified using two subscripts where the first subscript denotes the row and the second subscript denotes the column of the array using two-dimensional arrayswe can perform the different operations on matricestransposeadditionsubtractionmultiplication multi-dimensional array is an array of arrays like we have one index in one-dimensional arraytwo indices in two-dimensional arrayin the same way we have indices in an -dimensional or multidimensional array converselyan -dimensional array is specified using indices multi-dimensional arrays can be stored in either row major order or column major order sparse matrix is matrix that has large number of elements with zero value there are two types of sparse matrices in the first typeall the elements above the main diagonal have zero value this type of sparse matrix is called lower-triangular matrix in the second typeall the elements below the main diagonal have zero value this type of sparse matrix is called an uppertriangular matrix there is another variant of sparse matrixin which elements with non-zero value can appear only on the diagonal or immediately above or below the diagonal this type of sparse matrix is called tridiagonal matrix exercises review questions what are arrays and why are they needed how is an array represented in the memory how is two-dimensional array represented in the memory what is the use of multi-dimensional arrays explain sparse matrix how are pointers used to access two-dimensional arrays why does storing of sparse matrices need extra considerationhow are sparse matrices stored efficiently in the computer' memory for an array declared as int arr[ ]calculate the address of arr[ ]if base(arr and consider two-dimensional array marks[ ][ having its base address as and the number of bytes per element of the array is nowcompute the address of the elementmarks[ ][ ]assuming that the elements are stored in row major order how are arrays related to pointers briefly explain the concept of array of pointers how can one-dimensional arrays be used for interfunction communication consider two-dimensional array arr[ ][ which has base address and the number of bytes per element of the array nowcompute the address of the element arr[ ][ assuming that the elements are stored in column major order consider the array given belownameadam name[ charles name[ dicken name[ esha georgia name[ name[ hillary name[ mishael