There is more than one answer find them please

Part II: Understand Pointers/Dynamic Memory To-do 2: Write 3 different functions in C++ to create memory on the heap without causing a memory leak. Hint: You will need to assign the address to a pointer that was created outside the function. Remember, you can return an address or change what a pointer points to (the contents of a pointer) in a function by passing the pointer by reference or by passing the address of the pointer. Additional questions: What if you want to change the contents of what the pointer points to? Make a function that will set the contents of the space on the heap. Do you still need to pass by reference or the address of the pointer? Why or why not? How will you delete the memory off the heap? Try doing it outside a function, and inside a function. Make sure your delete function is setting your pointer back to NULL, since it is not supposed to be pointing anywhere anymore. You can check to see if you have any memory leaks using valgrind. Svalgrind program_exe…

These operations are using C syntax and Pointers

Language: C Write a program that will allocate memory to an array of the size specified by the user at runtime. Use malloc and free. Fill the array, print the elements and calculate the average value. A. In the main function: a) Ask the user for the size of the array. b) Using the malloc function allocate the double array of the size specified by the user. c) Check if the allocation was successful. - If the address returned by malloc is not NULL, use the rand function in a for loop and assign pseudorandom values to the array elements. Then call the function averagevalue. Print the result. Free up memory with the free function. - If the allocation failed and the address returned by malloc is NULL, print the message and exit the program. B. Define the function averagevalue and then call it in main. The function calculates the average value of the elements of the array passed as an argument and prints the array elements to the screen. The function returns the average value. C. Use…

Explain the various operations possible on pointer with example

Language: Java Write the function that produces the largest and smallest elements of an integer array sent to it, in accordance with themain function below. (Access to array elements should be done according to offset-address increment notation.)Sample Run:Biggest : 23Smallest : 0Sample Main................................/*prototip*/int main(){int array[5]={23, 4, 2, 0, 8};int biggest;int smallest;bigSmallFind(.............................)printf("Biggest : %d \n", biggest);printf("Smallest : %d \n", smallest);return 0;}

Character arrays and pointers in C: I have to search and sort through an EXTREMELY large text file in C using standard libraries. How do I import the text file and then access any character in the file using pointers? I need to be able to access multiple different characters at different positions in the file at once, so using the fgetc() function doesn't help as I can only access 1 character at a time in that order that it is read. The text file is way too big to create an empty char array and store each character and access them that way, so I'm not sure what else I can do. Thanks in advanced

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

Addressing and Address Binding: Select all of the following statements that are true. Direct addressing means that the address to be accessed is located elsewhere. Relocatable code must be generated if the memory location to be used is not known at compile time. Relative addressing means that the address to be accessed is specified as a distance from a reference address. Absolute addressing means that the address to be accessed is specified completely and without other reference addresses. Address binding is not possible during execution time. The logical address space is bound to a separate physical address space.