Given the Java function below, write an Assembly function called "f" and a main program that calls it. Assume that PC (program counter) initially has the address of the first instruction in the main program that you have written. private int f( int x, int y ) { if( x == 0) { return y: } else { return f( x - 1, y + 1 ); public static void main () { int x = 8; int y = 9; int z; z = f(f(4,4),9);

Given the Java function below, write an Assembly function called "f" and a main program that calls it. Assume that PC (program counter) initially has the address of the first instruction in the main program that you have written. private int f( int x, int y ) { if( x == 0) { return y: } else { return f( x - 1, y + 1 ); public static void main () { int x = 8; int y = 9; int z; z = f(f(4,4),9);

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

What is the purpose of using a virtual machine to represent the execution environment of a Java class? The distinction between this virtual machine and a real-world computer that runs C code is explained in detail below.
Please give a full detailed optimized solution in Java 8 for the given problem, use the example code provided as well. Please provide comments and screenshots of code and output. Also, add the time/space complexity and the reason for it.Java 8 Code Example:import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String args[] ) throws Exception { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ } }
In JAVA ______ class can encapsulate an entire executing program.
Implement a subprogram which takes 4 numbers in the argument registers $a0...$a3, andreturns the largest value and the average in $v0 and $v1 to the calling program. Theprogram must be structured as follows:Subprogram largestAndAverage($a1, $a2, $a3, $a4){ int var0 = $a0, var1 = $a1, var2 = $a2, var3 = $a3; $s0 = getLarger($a1, $a2); $s0 = getLarger($s0, $a3); $v0 = getLarager(s0, $a4); // Largest is in $v0 $v1 = (var0 + var1 + var2 + var3)/ 4; // Aversge is in $v1 return;}Subprogram getLarger($a0, $a1) { $v0 = $a0 if ($a1 > $a0) $v0 = $a1 return;}Note the use of the variables var0...var3. Because the values of $a0 and $a1 (at least) arechanged on the call to getLarger, they will not be available when they are needed to calculatethe average, and must be stored on the stack. To do this problem correctly, you mustcalculate the maximum value using the getLarger subprogram shown here, and it must becalled before the average is calculated. This implies that at a minimum $a0 and $a1 must…
Implement a subprogram which takes 4 numbers in the argument registers $a0...$a3, andreturns the largest value and the average in $v0 and $v1 to the calling program. Theprogram must be structured as follows:Subprogram largestAndAverage($a1, $a2, $a3, $a4){ int var0 = $a0, var1 = $a1, var2 = $a2, var3 = $a3; $s0 = getLarger($a1, $a2); $s0 = getLarger($s0, $a3); $v0 = getLarager(s0, $a4); // Largest is in $v0 $v1 = (var0 + var1 + var2 + var3)/ 4; // Aversge is in $v1 return;}Subprogram getLarger($a0, $a1) { $v0 = $a0 if ($a1 > $a0) $v0 = $a1 return;}Take note of how var0...var3 are used. The values of $a0 and $a1 (at least) must be placed on the stack because they are not immediately available when needed to calculate the average because they are modified during the call to getLarger. You must use the getLarger subprogram displayed above to calculate the greatest value for this problem, and it must be called before the average calculation. This indicates that at the very least $a0…
Suppose we have two different compilers, A and B, which each compile the same Java program to a particular computer’s machine language. Compiler A results in a program with 2.0 x 109 instructions and a CPU time of 1.1s. Compiler B results in a program with 2.4 x 109 instructions and a CPU time of 1.5s. What is the average CPI for each compiler’s program if the computer’s processor has a clock cycle time of 1ns? Suppose a new compiler C is developed which results in a program with 9.2 x 108 instructions and a CPI of 1.1. What is the speedup of using compiler C instead of compiler A? Instead of compiler B? Suppose we run the programs compiled by compilers A and B on two separate computers. Suppose also that the CPU time for each is exactly the same. How much faster is the clock running compiler A’s code versus the clock running compiler B’s code? (Hint: the first step is to calculate the total cycles each program requires)
Write a Java program to compare the populations of two states. (1) Ask the user to input the name of the first state (2) Ask the user to input the population of the first state (must be the integer type) (3) Ask the user to input the name of the second state (4) Ask the user to input the population of the second state (must be the integer type) (5) Compute the ratio of the first state’s population compared to that of the second state (the ratio value should be decimal point value like 0.72, 2.35 etc.). (6) Print out the comparison results: The population of State XXX is XXX times of State XXX.
The phrase "virtual machine" is used to refer to the environment in which a Java class is executed, but what does it imply exactly? The distinction between this virtual computer and a real machine that executes C-language code is explained below.
Why is a virtual machine used to represent a Java class's execution environment? What is the difference between this virtual machine and a real-world computer executing C code?
Explain the difference between a Java program running on a Java Virtual Machine as opposed to a C++ program running on the operation system shell.
Consider the following Java code in which most of the instructions have been commented out.
The Java bytecode for access to the local variable array for a class is at most two bytes long. One byte is used for the opcode; the other indicates the offset into the array. How many variables can be held in the local variable array? What do you think happens when this number is exceeded?