public static void main(String [] args) { int[] a = new int[20]; a[0]...

public static void main(String [] args)

{

int[] a = new int[20];

a[0] = 0;

a[1] = 1;

for(int i = 2; i < 20; i++){

a[i] = a[i - 1] + a[i - 2];

}

for(int i = 0; i < a.length; i++)

System.out.println(a[i]);

}

what would be the code when you convert this code, which is java into assembly code? Convert java into assembly code for the code above

Expert Solution

Answer:

The Assembly Language Code For The Given Java Code Is Given As Below :

push rbp
mov rbp, rsp
sub rsp, 96
mov DWORD PTR [rbp-96], 0
mov DWORD PTR [rbp-92], 1
mov DWORD PTR [rbp-4], 2
.L3:
cmp DWORD PTR [rbp-4], 19
jg .L2
mov eax, DWORD PTR [rbp-4]
sub eax, 1
cdqe
mov edx, DWORD PTR [rbp-96+rax*4]
mov eax, DWORD PTR [rbp-4]
sub eax, 2
cdqe
mov eax, DWORD PTR [rbp-96+rax*4]
add edx, eax
mov eax, DWORD PTR [rbp-4]
cdqe
mov DWORD PTR [rbp-96+rax*4], edx
add DWORD PTR [rbp-4], 1
jmp .L3
.L2:
mov DWORD PTR [rbp-8], 0
.L5:
cmp DWORD PTR [rbp-8], 19
jg .L4
mov eax, DWORD PTR [rbp-8]
cdqe
mov eax, DWORD PTR [rbp-96+rax*4]
mov esi, eax
mov edi, OFFSET FLAT:std::cout
call std::basic_ostream<char, std::char_traits<char> >::operator<<(int)
add DWORD PTR [rbp-8], 1
jmp .L5
.L4:
mov eax, 0
leave
ret
__static_initialization_and_destruction_0(int, int):
push rbp
mov rbp, rsp
sub rsp, 16
mov DWORD PTR [rbp-4], edi
mov DWORD PTR [rbp-8], esi
cmp DWORD PTR [rbp-4], 1
jne .L9
cmp DWORD PTR [rbp-8], 65535
jne .L9
mov edi, OFFSET FLAT:std::__ioinit
call std::ios_base::Init::Init()
mov edx, OFFSET FLAT:__dso_handle
mov esi, OFFSET FLAT:std::__ioinit
mov edi, OFFSET FLAT:std::ios_base::Init::~Init()
call __cxa_atexit
.L9:
nop
leave
ret
_GLOBAL__sub_I_main:
push rbp
mov rbp, rsp
mov esi, 65535
mov edi, 1
call __static_initialization_and_destruction_0(int, int)
pop rbp
ret

venereology answered 1 hour ago

public class Lab1 { public static void main(String[] args) { int array [] = {10, 20,...

public class Lab1 { public static void main(String[] args) { int array [] = {10, 20, 31, 40, 55, 60, 65525}; System.out.println(findPattern(array)); } private static int findPattern(int[] arr) { for (int i = 0; i < arr.length - 2; i++) { int sum = 0; for (int j = i; j < i + 2; j++) { sum += Math.abs(arr[j] - arr[j + 1]); } if (sum == 20) return i; } return -1; } } QUESTION: Modify the given...

public class Main { public static void main(String [] args) { int [] array1 = {5,...

public class Main { public static void main(String [] args) { int [] array1 = {5, 8, 34, 7, 2, 46, 53, 12, 24, 65}; int numElements = 10; System.out.println("Part 1"); // Part 1 // Enter the statement to print the numbers in index 5 and index 8 // put a space in between the two numbers and a new line at the end // Enter the statement to print the numbers 8 and 53 from the array above //...

---------------------------------------------------------------------------- public class Main { public static void main(String[] args) { int[] A = {11, 12,...

---------------------------------------------------------------------------- public class Main { public static void main(String[] args) { int[] A = {11, 12, -10, 13, 9, 12, 14, 15, -20, 0}; System.out.println("The maximum is "+Max(A)); System.out.println("The summation is "+Sum(A)); } static int Max(int[] A) { int max = A[0]; for (int i = 1; i < A.length; i++) { if (A[i] > max) { max = A[i]; } } return max; } static int Sum(int[] B){ int sum = 0; for(int i = 0; i --------------------------------------------------------------------------------------------------------------------------- Convert...

class Main { public static void main(String[] args) { int[] array = {1,2,3,4,5}; ...

class Main { public static void main(String[] args) { int[] array = {1,2,3,4,5}; //Complexity Analysis //Instructions: Print the time complexity of method Q1_3 with respect to n=Size of input array. For example, if the complexity of the //algorithm is Big O nlogn, add the following code where specified: System.out.println("O(nlogn)"); //TODO } public static void Q1_3(int[] array){ int count = 0; for(int i = 0; i < array.length; i++){ for(int j = i; j < array.length;...

public class OOPExercises { public static void main(String[] args) { A objA = new...

public class OOPExercises { public static void main(String[] args) { A objA = new A(); B objB = new B(); System.out.println("in main(): "); System.out.println("objA.a = "+objA.getA()); System.out.println("objB.b = "+objB.getB()); objA.setA (222); objB.setB (333.33); System.out.println("objA.a = "+objA.getA()); System.out.println("objB.b = "+objB.getB()); } } Output: public class A { int a = 100; public A() { System.out.println("in the constructor of class A: "); System.out.println("a = "+a); a =...

import javax.swing.JOptionPane; public class RandomGuess { public static void main(String[] args) { int guess; int result;...

import javax.swing.JOptionPane; public class RandomGuess { public static void main(String[] args) { int guess; int result; String msg; final int LOW = 1; final int HIGH = 10; result = LOW + (int)(Math.random() * HIGH); guess = Integer.parseInt(JOptionPane.showInputDialog(null, "Try to guess my number between " + LOW + " and " + HIGH)); if(guess == result) msg = "\nRight!"; else if(guess < result) msg = "\nYour guess was too low"; else msg = "\nYour guess was too high"; JOptionPane.showMessageDialog(null,"The number...

public static void main(String[] args) { Scanner input = new Scanner(System.in); String[]...

public static void main(String[] args) { Scanner input = new Scanner(System.in); String[] strings = new String[100]; for (int i = 0; i < strings.length; i++) { System.out.println("Enter Strings: stop "); strings[i]=input.nextLine(); if(strings[i].equalsIgnoreCase("stop")) break; } MaxLength(strings);//here is the error } public static int MaxLength(String[] array) { int max = array[0].length(); ...

class Main { public static void main(String[] args) { int[] array = {1,2,3,4,5}; //Complexity Analysis //Instructions:...

class Main { public static void main(String[] args) { int[] array = {1,2,3,4,5}; //Complexity Analysis //Instructions: Print to n=Size of input array. For example, if the complexity of the //algorithm is Big O nlogn, add the following code where specified: System.out.println("O(nlogn)"); //code here } public static void (int[] array) { int count = 0; for(int i = 0; i < array.length; i++) { for(int j = i; j < array.length; j++) { for(int k = j; k < array.length; k++)...

Consider this program: public class Main { public static void main(String[] args) { String s1 =...

Consider this program: public class Main { public static void main(String[] args) { String s1 = "hello"; String s2 = "hello"; String s3 = new String("hello"); System.out.println(s1 == s2); System.out.println(s2 == s3); System.out.println(s2.equals(s3)); } } When we run the program, the output is: true false true Explain why this is the output, using words and/or pictures.

public class Main{ public static void main (String[] args) { Map<Integer, String> ssnMap = new HashMap<Integer,...

public class Main{ public static void main (String[] args) { Map<Integer, String> ssnMap = new HashMap<Integer, String>(); ssnMap.put (8675309,"Jenney"); ssnMap.put (42, "Answer to Everything"); ssnMap.put (8675309, "Stacy"); ssnMap.put (1006, "Peter"); System.out.println(ssnMap.get (8675309)); } } What is the output of the above code. Why?

Question