Final answer:
There are 39 elements in the array ADMISSION, none of the given multiple choice answers is correct. Without information on the size of each word in bytes, we cannot calculate the precise address of ADMISSION[2000], but a hypothetical example calculation was provided.
Step-by-step explanation:
The question asks for two calculations related to an array ADMISSION used to record the number of students admitted each year at a university from 1981 through to 2019. To answer the following sub-questions:How many elements are there in ADMISSION?The address of ADMISSION[2000].To find the number of elements in the array ADMISSION, we calculate the difference between the end year and the start year plus one. That is:2019 - 1981 + 1 = 39 elements.Therefore, the correct answer to part (i) is 39 elements, none of the options given (a) 320, (b) 140, (c) 279, or (d) 1999 is correct.
To calculate the address of ADMISSION[2000], we need to consider each cell occupies w words with each word likely a certain number of bytes. However, without information on the size of each word, we cannot directly calculate the exact memory address. For a hypothetical example assuming a word is one byte: address of ADMISSION[2000] = Base address + (2000 - 1981) * words per memory cell. If we consider the base year as starting at 0 (1981), the year 2000 is at index 19. So, the calculation would be: address of ADMISSION[2000] = 320 + 19 * 7 = 453.However, without explicit information regarding the word size in bytes, a definitive address calculation is not possible.(i). To calculate the number of elements in the array ADMISSION, we need to subtract the base address (320) from the address of the last element (2019). We then divide the result by the number of words per memory cell (7). So the calculation would be: (2019 - 320) / 7 = 171. Therefore, there are 171 elements in ADMISSION.