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;}

Write a java program that calls following three methods that use for loops or nested for loops to produce the output described below. Needs to be written in one program, all three methods in one program. A method called multi that prints multiplication tables for numbers from 1 to 10. 1 x 1 = 1 1 x 2 = 2                         .                         .                         . 1 x 10 = 10 --------------------------- 2 x 1 = 2 2 x 2 = 4 . . . 2 x 10 = 20 ---------------------------             .             .             . ---------------------------             .             .             . 10 x 9 = 90 10 x 10 = 100 -----------------------------       Method called triangle that prints following triangle pattern       1      12    123   1234  12345   Method called reverse that reverses a string passed to this method as a parameter and returns the reversed string. Eg reverse(“string”) should return “gnirts”. Print out the reversed string in your main method. Hint: Use CharAt…

Write a program in java to take the value of x from user and find the value of 2*x^3 -3x^2+ 5*x+ 16 and print the results

Show the derivation of the asymptotic run time,  O(n),  for each of the following methods. You may use the text highlighting technique shown in class, or list the individual Java statements along with the number of times each is executed as a function of the input size, n. public static void checkerboard(int n){   for (int row = 0; row < n; row++) {          for (int col = 0; col < n; col++){       if ((row+col)%2 == 0) {         // Print a single hashtag         System.out.print("#");       } else {               // Print a single space         System.out.print(" ");       }          }     // Complete the line     System.out.println();   } }

Write a Java program that expands a given binomial (x + y)^n, where integer n is user input. To do the work of the binomial expression, first create a method that accepts n as a parameter and then returns an array holding the coefficients needed for the binomial expansion using the Pascal’s Triangle method. Create a 2nd method which takes the array holding the coefficients as a parameter and prints the appropriate binomial expansion. For example, if n = 5 is entered by the user, the method calculating the coefficients should return {1,5,10,10,5,1} and the method that prints the expansion should print the following: (x + y)^5 = x^5 + 5x^4y + 10x^3y^2 + 10x^2y^3 + 5xy^4 + y^5 Your main method should use an appropriate loop for repeated inputs and automatically call the methods to calculate the coefficients and print the binomial expansion. There isn’t a need for a menu although you should ask the user if they want to quit or continue after their binomial expansion is printed each time.…

3. Write a Java program to implement a method which prints the Fibonacci series up to nth term. The value of n will be taken from the user in the main() method.Fibonacci series starts with 0 and 1, and the sum of previous two numbers is the next number of the series. For instance, 0, 1, 1 (0 + 1), 2 (1 + 1), 3 (1 + 2), and so on.Sample output [assuming the number of term (n) is 8]:The Fibonacci series: 0 1 1 2 3 5 8 13

Write a Java program that implements static method roundSum() so that given 3 ints: a, b, and c; return the sum of their rounded values. We'll round an int value up to the next multiple of 10 if its rightmost digit is 5 or more, so 15 rounds up to 20. Alternately, round down to the previous multiple of 10 if its rightmost digit is less than 5, so 12 rounds down to 10. roundSum(16, 17, 18) → 50roundSum(12, 13, 14) → 40roundSum(6, 4, 4) → 10   The examples of input and output you can see in the picture. (the code structure should be as in the second picture)

Write down the outputs of the following java program public class Exam {       String X = "Programming";       double Y = 3;       static int N; Exam ( ) {    N++ ; }   public static void main(String args[]) {               Exam s1 = new Exam ( );         Exam s2 = new Exam ( );         System.out.println("1.   " + (s1.Y));          System.out.println("2.   " + s1.X.replaceFirst("r", "S"));         System.out.println("3.   " + s2.N); } }

Consider the following C function or Java method (except for final printstatement the code is the same):void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}printf ("%d\n", d);}void fun (int x) {int a, b, c, d;d = 1;for (a = 1 ; a <= x ; a ++) {b = a;c = 1;while (b > 0) {c &= b % 2;b /= 2;}d += c;}System.out.println (d);} (a) What output will be printed for input value x = 8 ?(b) How many dierent input values x cause the function to print theresult 8 ?(c) Write a function with the same behavior but only one loop (of anytype) and no library call except for the print statement.

How to write a java program that return the nth Fibonacci number when passed the argument using a recursive method called Fibonacci and using a nonrecurive called FibonacciNonRecursive. Then write a driver to test the two versions of the two methods. Then compare the recursive method and a nonrecurive method for efficiency using comments. (The Fibonnacci sequence is the series of integers 0,1,1,2,3,5,8,13,21,34,55,89... Each element in the series is the sum of the preceding two elements. Here is recursive formula for calculating the nth number of the sequence fib(N)=N if N=0 or 1, fib(N)= Fib(N-2) +Fib(n-1), if N>1)