1) memcopy Write a C function memcopy that will copy n integers from one array to another. The function should have 3 parameters: the to array, the from array and the integer n. Generate assembler for this function (using -S) and figure out roughly what it does, including where each variable or parameter is stored and what assembler corresponds to each C statement.

Pointer arithmetic. Implement the following:a. Implement a print function with array and size parameters. This function should print the array using pointer arithmetic.b. Overload the print function to accept array, size and index parameters. If the index is between 1 and size-2 inclusive:          Use pointer arithmetic to print:            1. the value at index            2. the value previous to the index            3. the value after the index c. Implement a sum function with array and size parameters. This function should return sum of the array, and use pointer arithmetic.d. Implement a average function with array and size parameters. This function shouldreturn average of the array, and use pointer arithmetic.e. Use provided main function to test your functions. ( Do not change the int main the question has provided. Included a snip of the int main function. Output has to be the same as shown in the snips)

(iii) write Operations that can be performed in any application using the dictionary data structure with example and the time estimates.

What are the disadvantages of arrays?a) Data structure like queue or stack cannot be implementedb) There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated sizec) Index value of an array can be negatived) Elements are sequentially accessed

(python) 14. Based on the following Sorted List, show the steps of a Binary Search if the search key was -5: Enter the index value for the left, right and comparison.  Enter one of the following for the Result answers: Left, Right, Found, Not Found.  If there is no value needed in a location, put N/A [ -34, -23, -11, -5, 1, 3, 7, 11, 14, 19, 20, 25, 33, 42 ]

Lab Task: You are required to make changes in the above programs and introduce the use of compaction where required. Write code to simulate Worst-Fit Algorithm Write a C program to simulate the MVT and MFT memory management techniques.   Write a C program to simulate the following contiguous memory allocation techniques Worst-fit Best-fit First-fit   TASK1: DESCRIPTION MFT (Multiprogramming with a Fixed number of Tasks) is one of the old memory management techniques in which the memory is partitioned into fixed size partitions and each job is assigned to a partition. The memory assigned to a partition does not change. MVT (Multiprogramming with a Variable number of Tasks) is the memory management technique in which each job gets just the amount of memory it needs. That is, the partitioning of memory is dynamic and changes as jobs enter and leave the system. MVT is a more ``efficient'' user of resources. MFT suffers with the problem of internal fragmentation and MVT suffers with…

Explain how to examine the memory address of the pointer directed to.

Q2.(a) Explain data structure Stack with an example? Write C-functions to implement the 2-stack using array.

Exercise 1: Memory Allocation in C a) Write a C program which dynamically allocates memory to define an integer 5 x 5 matrix initialized to zero by using the calloc function. Do not forget to free the memory in the end of your program. b) What happens if you attempt to print your matrix before and after freeing memory?