Give the output of the following program using the four parameter passing methods(Pass by Value, Pass by Reference, Pass by Value-Result, Pass by Name). Code: int i;int a[3]; void swap(int x, int y){    x = x + y;    y = x - y;    x = x - y;} main(){    i = 1;    a[0] = 2;    a[1] = 1;    a[2] = 0;    swap(i,a[i]);    printf("%d %d %d %d\n", i, a[0], a[1], a[2]);    swap(a[i],a[i]);    printf("%d %d %d\n", a[0], a[1], a[2]);    return 0;}

Given the following piece of code : int i=5,sum while(i<10) = 0; { sum-=i; i++; } What is the value of sum after it is executed ?

Please answer 6 and 7 as they are associated altogether. 6. The FixProgram.java below has some errors.a. Fix the errors so that the program successfully compiles and runs. class FixProgram{ public static void main(String[] args) { System.out.println('Hello World!') }}  7. Change the SampleProgram.java program below.a. So that it displays Programming is fun! Instead of Hello World! class SampleProgram{ public static void main(String[] args) { System.out.println("Hello World!"); }}

JAVA  Question 2: For two integers m and n, their GCD (Greatest Common Divisor) can be computed by a recursive method. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Method body: If m is 0, the method returns n. If n is 0, the method returns m. If neither is 0, the method can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n (or m % n). The recursive method cannot have loops. Note: although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. main method: Prompt and read in two numbers to find the greatest common divisor. Call the gcd method with the two numbers as its argument. Print the result to the monitor.   Example program run: Enter m: 12 Enter n: 28 GCD(12,28) = 4 And here is what I have so far, package CSCI1302;import java.util.*;public class RecursionDemo {    public static void…

10. public static void methodl (int i, int num) { for (int j = 1; j <= i; j++) { " "); System.out.print (num + num *= 2; } System.out.println(); } public static void main(String[] args) { int i = 1; while (i <= 6) { methodl (i, 2); i++; }

Method Overloading is a feature that allows a class to have two or more methods having same name, if their argument lists are different. Argument lists could differ in: 1. Number of parameters. 2. Data type of parameters. 3. Sequence of Data type of parameters. Write different version of method sum() that display the sum of the values received as parameter according to the following main method content: public static void main(String[] args) { sum ( 10, 10 ); sum ( 10, 10, 10 ); sum ( 10.0, 10.0 ); sum ( 10, 10.0 ); sum ( 10.0, 10); } You have to define five functions with the specified types. Then, demonstrate the Argument Promotion concept by reducing the number of method to two.

Class Utilities { Method Details addDelimiter: public static java.lang.String addDelimiter​(java.lang.String str, char delimeter) Returns a string where characters are separated by the specified delimeter character. A string with a single character will not have a delimeter added. The space character is consider a character (similar to character 'A'). You can assume str will never be the empty string. You may not use an auxiliary method in order to implement this method. Your implementation must be recursive and you may not use any loop construct. Note: In java given two characters a and b, a + b will not create a string. To create a string, append a to the empty string and the result to b. From the String class, the only methods you can use are length(), isEmpty(), charAt() and substring. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: str - delimeter - Returns: String with characters…

#include int main(void) { int a[3][3] = {1,3,5,7,9}; int i,j,sum=0; for (i = 0; i < 3; i++) for (j = 0; j < 3; j++) sum += a[i-i][j-j]; %3D printf("%d\n",sum); return 0; }

Complete the convert() method that casts the parameter from a double to an integer and returns the result.Note that the main() method prints out the returned value of the convert() method. Ex: If the double value is 19.9, then the output is: 19 Ex: If the double value is 3.1, then the output is: 3 code: public class LabProgram {      public static int convert(double d){      /* Type your code here */               }   public static void main(String[] args) {      System.out.println(convert(19.9));      System.out.println(convert(3.1));   }}

8.Write a static method recReplace that takes a String str, a String sub1, and a String sub2 as parameters, and replaces all occurrences of sub1 in str with sub2. The method should be recursive, which means no loops. public static String recReplace(String str, String sub1, String sub2) {