Write a c++ code that implement a loop that accesses a number of different locations in an array over-and-over again, and see how the average access time changes as the array size increases, from a size small enough to fit in L1 cache to a size too large to fit in L2 (or L3) cache.  Try to estimate the sizes of your caches

You are to write a C program that searches through the an array that contains a sequence of numbers in an and that a end with the number zero. That array should be declared and initialized exactly as follows in your program: int DNA[] = {1, 2, 4, 2, 2, 2, 1, 4, 4, 2, 3, 4, 4, 4, 2, 1, 4, 1, 3, 3, 2, 1, 3, 2, 1, 1, 2, 2, 2, 3, 4, 1, 3, 1, 2, 1, 4, 4, 4, 1, 1, 3, 1, 4, 2, 4, 4, 1, 4, 4, 1, 4, 4, 4, 4, 1, 1, 2, 3, 3, 3, 3, 4, 4, 3, 2, 3, 2, 3, 4, 3, 3, 4, 4, 1, 3, 3, 2, 1, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 1, 4, 3, 4, 4, 4, 1, 2, 1, 3, 2, 0};   Your program should repeatedly ask the user for two things: the length of a search sequence, and the search sequence itself. The program should then search through the array “DNA” to find the starting element subscript (index) of all possible matching sequences. The elements of the search sequence may take on one of five characters: 1,2,3,4 and 5. The meaning of the ‘5’ character is that of wild card, i.e. it matches 1,2,3 and 4. The program…

Write a program with a loop and indexed addressing that calculates the sum of all the gaps between successive array elements. The array elements are doublewords, sequenced in nondecreasing order. So, for example, the array 0, 2, 5, 9, 10 has gaps of 2, 3, 4, and 1, whose sum equals 10. assembly language

in C++ solve the following question in the picture :