What should be done if implicit heap-dynamic variables are to be used, when they should not be used, and why they should not be used are all addressed.

Study the scenario and complete the question(s) that follow: The Fork/Join Framework is used for parallel programming in Java. The Fork/Join Framework when illustrated in form of a diagram resembles a fork, hence its name. A problem is divided into nonoverlapping subproblems, which can be solved independently in parallel. The solutions to all subproblems are then joined to obtain an overall solution for the problem. This is the parallel implementation of the divide-and-conquer approach. In JDK 7's Fork/Join Framework, a fork can be viewed as an independent task that runs on a thread. In this task, you are required to write a Java program in NetBeans that implements Parallel programming using the Fork/Join framework. Your program should initially generate 15 million random numbers. This should be read into an array of doubles. Then it should make use of a method that uses this array to calculate the sum of these doubles. Your program should make use of the subclasses in the Fork/Join…

What is the method for storing local declarations in computer memory? Is there any reason to avoid using local declarations if the same objective can be achieved without them? Why use value parameters if reference parameters can be used in any function? What role do value parameters play in program data processing?

A memory system has a 32 KB byte-addressable main memory and a 1 KB cache where each block contains 16 bytes. Determine the format of the address in each of the cache organizations. In each case list the address fields and the width of each field.a) Direct-mapped cacheb) Fully-associative cachec) 4-way set-associative cache

What are a few uses for the dynamic programming approach?

What are some of the possible benefits of using dynamic programming?

What are the potential advantages of dynamic programming?

What are some practical applications of the dynamic programming approach?

Make a list of all the ways that dynamic programming and the divide-and-conquer approach are different.

Analyze and write a comparison of using C++ pointers and Java reference variables to refer to fixed heap-dynamic variables. Use safety and convenience as the primary considerations in the comparison.