What is done at run time to allocate the C/C++ array? What is done at...

Question

Question

What is done at run time to allocate the C/C++ array?

What is done at run time to release the C/C++ array?

What is done at run time to allocate the Java array?

What is done at run time to release the Java array?

engineering Computer-Science

Answer 1

Answer #1

in c++:

allocating memory int *ptr=new int[10];

deallocating memory delete[] ptr;

in java:

allocating memory int ptr[]=new int[10];

we need not to explicitly delete in java, garbage collector will do it automatically.

Answer 2

Similar Homework Help Questions

Code in C #### Array of pointers 1. Define a structure. 2. Allocate a *dynamic* array...

Code in C #### Array of pointers 1. Define a structure. 2. Allocate a *dynamic* array of **pointers** to structures. What is the type of the array variable? 3. Sketch the array on the worksheet. 3. Assign values in a loop. 4. Free all dynamic memory. Mind the order to avoid leaving dangling pointers!
In C, what is the correct way to allocate dynamically an array of doubles named x...

In C, what is the correct way to allocate dynamically an array of doubles named x a) x = (double) calloc (size, sizeof (int)); b) x = (double *) calloc (size, sizeof (int)); c) x = (double *) calloc (size, sizeof (double)); d) x = (int *) calloc (size, sizeof (int)); e) none of these explain why
WRITE THE NECESSARY C++ STATEMENTS 1. (10 points) Allocate memory dynamically for an int array with...

WRITE THE NECESSARY C++ STATEMENTS 1. (10 points) Allocate memory dynamically for an int array with 100 elements. Next, assign the value of 1 to all the elements of the array and, finally, delete the array.

How to dynamically allocate a 2D array if the number of row is not defined? (in...

How to dynamically allocate a 2D array if the number of row is not defined? (in C-Language) Need an example code.
What is the purpose of the new operator? Select one: a. It is used to allocate...

What is the purpose of the new operator? Select one: a. It is used to allocate memory for variables at runtime. b. It is used to declare a new function. c. It is used to initialize class member variables. d. It is used to start a new program. e. It allows new operators to be created. Question 2 Not yet answered Scored out of 1.00 Flag question Question text Under what circumstances can you successfully return a pointer from a...
2.1 Searching and Sorting- 5 points each 1. Run Heapsort on the following array: A (7,3, 9, 4, 2,5, 6, 1,8) 2. Run merge sort on the same array. 3. What is the worst case for quick sort? What is...

2.1 Searching and Sorting- 5 points each 1. Run Heapsort on the following array: A (7,3, 9, 4, 2,5, 6, 1,8) 2. Run merge sort on the same array. 3. What is the worst case for quick sort? What is the worst case time com- plexity for quick sort and why? Explain what modifications we can make to quick sort to make it run faster, and why this helps. 4. Gi pseudocode for an algorithm that will solve the following...

Subject: Algorithm need this urgent please. 2.1 Searching and Sorting- 5 points each 1. Run Heapsort on the following array: A 17, 3, 9, 4, 2,5, 6, 1,8) 2. Run merge sort on the same array 3. What...

Subject: Algorithm need this urgent please. 2.1 Searching and Sorting- 5 points each 1. Run Heapsort on the following array: A 17, 3, 9, 4, 2,5, 6, 1,8) 2. Run merge sort on the same array 3. What is the worst case for quick sort? What is the worst case time com- plexity for quick sort and why? Explain what modifications we can make to quick sort to make it run faster, and why this helps. 2.1 Searching and Sorting-...
write a c++ program that prompts a user for a number then attempts to allocate an...

write a c++ program that prompts a user for a number then attempts to allocate an array of as many integers as the user enters. In other words, the program might prompt the user with a line like: “How many integers would you like to allocate?” It should then allocate as many integers as the user enters. The program should then wait for the user to press enter before deleting the allocated array and quitting. We will use this time...
what is the worst case run time when finding the maximum value in a binary min...

what is the worst case run time when finding the maximum value in a binary min heap(implemented using array ) containing N elements? worst case run time: explain:

This is in Java being run through Eclipse. /** * Creates an array of all...

This is in Java being run through Eclipse. /** * Creates an array of all the powers of two, up to (and including) * the given exponent starting at 2^0. * * If the given exponent is less than zero, return an empty array. * You can do this by saying "return new int[0];" * * For example: * powersOfTwo(3) returns {1,2,4,8} * powersOfTwo(0) returns {1} * powersOfTwo(-66) returns {}...