we may continue this process to create linked list of any number of values each time you need to store value allocate the node and use it in the list for examplenotes node next=&node would add another link also every list must have an end this is necessary for processing the list has special pointer value called null that can be stored in the next field of the last node in the above two-node listthe end of the list is marked as followsnode next=nullthe value of the value member of node can be accessed using the next member of node as followscoutvaluetask write syntax to represent node arrays implementation array group of finite number of identical type of elements accessible by common name an array has name which is also the name of each of its elements for examplelet there be an array abc of integers having elements the same is shown below the names of different elements are shown below abc[ abc[ abc[ abc[ abc[ abc[ index or subscript the integral value that corresponds to the ordinal position of an array element is called index or subscript dimensions of an array on the basis of the number of indices required to access member element in an arrayan array can be classified into the following categories single-dimensional arrays multi-dimensional arrays each type of array has different kind of memory representation memory allocation to arrays member elements of an array are provided contiguous memory locations when program requests the operating system that it intends to create an array the operating system computes the size of one element and multiplies the same with the number of elements requested to obtain the total number of memory cells required the operating system then allocates those many lovely professional university