(30 points; 6 points each part) For each code fragment below, show a memory diagram that traces t...
For each code fragment below, show a memory diagram that traces the execution of the calling method. d) //calling method intp data = {1, 3, 5); method(datal2 public static int methodliot size) nt source new intfsize: for (int i-0; issourclength:i) sourceli)-size; return source; Heap Identifier Address Contents Main Stack Frame 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 Identifier Address Contents 101 102 103 Method Stack Frame Identifier Address Contents 200 201 202
//calling method int[] data = {7, 4, 3, 2}; int size = 2; method(data, size); public static int[] method(int[] array, int length) { int[] result = new int[length]; for (int index = 0; index < length && index < array.length; ++index) result[index] = array[index]; return result; } Heap Identifier Address Contents 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 Main Stack Frame Identifier Address Contents 101 102 103...
Question 1: Pointers You are given the following C code and memory diagram. The “contents” column of the memory diagram shows the value of the variable. Update the “contents” column of the memory diagram for each assignment in main(). long *pt; long data; long buffer[4]; void main(void){ pt = &buffer[1]; *pt = 1234; data = *pt; } address contents variable 0x20000000 0x00000000 pt 0x20000004 0x00000000 data 0x20000008 0x00000000 buffer[0] 0x2000000C 0x00000000 buffer[1] 0x20000010 0x00000000 buffer[2] 0x20000014 0x00000000 buffer[3]...
6. (4 points) The following code for insertion sort has been modified to print out the sorted component of the array during the sort. What will be the output of running the main method of the following code? Try to trace by hand and then verify by executing the code public class Insertion ( public static void sort (String[] a) f int n- a.length; for (int i-1; i < n; i++) f for (int j i; j 0; j--) if...
a. Draw a memory diagram to illustrate the passing of parameters with respect to the method call r.compareTo(s) in the following code. More specifically, illustrate how the calling object and parameter object are referenced during the execution of the method r.compareTo(s). b. For the same definition for class Rectangle as part a., draw the memory diagram that illustrates the storage of array and objects when the following code executes: class Rectangle { private double length, breadth; public Rectangle(double 1, double...
a. Draw a memory diagram to illustrate the passing of parameters with respect to the method call r.compareTo(s) in the following code. More specifically, illustrate how the calling object and parameter object are referenced during the execution of the method r.compareTo(s). b. For the same definition for class Rectangle as part c., draw the memory diagram that illustrates the storage of array and objects when the following code executes: Rectangle { private double length , breadth; class public Rectangle(double 1,...
b) Consider the following code. public static int f(int n) if (n == 1) return 0; else if (n % 2 == 0). return g(n/2); else return g(n+1); public static int g(int n) int r = n % 3; if (r == 0) return f(n/3); else if (r == 1) return f(n+2); else return f(2 * n); // (HERE) public static void main(String[] args) { int x = 3; System.out.println(f(x)); (1) (5 points) Draw the call stack as it would...
C PROGRAM The following is code prints the current activation record number, the memory address of the current array, followed by the estimated size of the current activation record as a distance between the current array address and the array address from the previous activation record. I need it to run until a segmentation fault occurs and also it must print the estimated size of the runtime stack as a product of the size of current activation record and the...
Building Each Exercise Driver Download the drivers (ExerciseX.java) and start by reading the code. Notice in Exercise1.java’s main how each method for the problems below have already been invoked for you (Skeleton Level: Strong). As you complete additional exercises, notice the comments in each file. As exercises progress, you’ll be required to uncomment lines in main or even build parts of the main driver yourself. We’ll start with skeleton files that are almost complete, and then look at drivers where...
Q21 Read the following code: 8 Points public class Main { public static int[][] doStuff() { int[][] array2D = new int[3][2]; for (int i = 0; i < array2D.length; i++) { for (int j = 0; j < array2D[0].length; j++) { array2D[i][j] = (i+j)%2; } } return array2D; فه public static void main(String[] args) { int[][] a = doStuff(); مہ سره Q21.1 What are the contents of array a? 6 Points Write your answer as if printing the elements row-by-row....