java QUESTION 8What is the value of x after the call to m1 in line 8 of the following code?50public static void main(String[] args){int x = 5 ;67m1(x);9.10}public static void m1 (int x){1101213if ( x > 0 || x < 3)x = x++ + (x + 2);else14151617x--;1819m2 (x);2021}22230public static void m2 (int x){while (x > 0) {242526x -- 3;}}272829O 5O-11Compiler errornone of the above

QUESTION 8 What is the value of x after the call to m1 in line 8 of the following code? public static void main(String[] args) { int x = 5 ; m1(x); 50 6 8. 9 10 } public static void m1 (int x) { 110 12 13 if ( x > 0 || x < 3) x = x++ + (x + 2); else 14 15 16 17 x--; 18 19 m2(x); 20 21 } 22 public static void m2 (int x) { while (x > 0) { 230 24 25 26 x -- 3; } } 27 28 29 O Compiler error none of the above

QUESTION 8 What is the value of x after the call to m1 in line 8 of the following code? public static void main(String[] args) { int x = 5 ; m1(x); 50 6 8. 9 10 } public static void m1 (int x) { 110 12 13 if ( x > 0 || x < 3) x = x++ + (x + 2); else 14 15 16 17 x--; 18 19 m2(x); 20 21 } 22 public static void m2 (int x) { while (x > 0) { 230 24 25 26 x -- 3; } } 27 28 29 O Compiler error none of the above

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

1.The following is the C code that you need to implement for this lab: uint8_ t f(uint8_tn) return(n<2)?(n):(f(n-1)+f(n-2)); The main function can be assumed as follows: int main() uint8_ t x; x=f(???); return 0; Obviously, " ? ? ? " is representing a value used to test the algorithm! Is "f"recursive? a.No answer text provided. b.Yes c.no d.depends on whether it is in for main 2.First, make the code in the previous question an actual C program so that it can be compiled and it runs. Play with it so that you feel comfortable with the logic of the code. Then implement the code in TTPASM. Note that you need to preserve the actual C code structure, this means you cannot it into a non-recursive subroutine. Furthermoreall conventions discussed in class regarding subroutines must be followed. The idea is that I should be able to substitute f with my own code, and main should work. Or, I can substitute main with my own, and f should work. Attach the source code of your assembly…
Problem 1 What is this? what does the following program do? "C language" #include <stdio.h> #define SIZE 10 int whatIsThis(const int b[], size_t p); int main(void) { int x; int a[SIZE]={1,2,3,4,5,6,7,8,9,10}; x = whatIsThis(a, SIZE); printf("Result is %d \n",x); } int whatIsThis(const int b[], size_t p) { if(1==p){ return b[0]; } else{ return b[p -1]+ whatIsThis(b, p-1); } }
IN JAVA intends to auto generate test cases for a function foo that has k integers as input arguments, i.e., foo(int n1, int n2, …, int nk). Each argument belongs to a different equivalence class, which are stored in a downloadable Eq.txt file. The content is shown below and may be modified to handle more inputs and equivalence classes. 1, 15; 16, 30 1, 10; 11, 20; 21, 30 1, 5; 6, 10; 11, 15 1, 3; 4, 6; 7, 9; 10, 12 1, 12; 13, 24 For this file, the nth row describes the nth input. Take the second row for example. There are five input arguments. The data 1, 10; 11, 20; 21, 30 indicates that argument n2 has three equivalence classes separated by the semi-colons. Develop an internal method “private int check(int val)” that returns the equivalence class the val is in. The result of check(val = 3) for n2 will be 1 and check(val = 25) for n2 will be 3. Regarding the function foo, it computes the sum of the returned values by the check function for all input arguments. Follow the contents…
Write the C equivalent “train” function #void train(int*A, int*B, int*C, int k) train: add $t4, $0, $0bus: add $t5, $t4, $a1 lw $t6, 0($t5) add $t5, $t4, $a2 lw $t7, 0($t5) add $t6, $t6, $t7 add $t5, $t4, $a0 sw $t6, 0($t5) addi $t4, $t4, 4 slt $t5, $t4, a3 bne $t5, $0, bus jr ra
What does the following program do? #include <stdio.h> #define SIZE 10 void someFunction(const int b[], size_t startIndex, size_t size); int main(void) { int a[SIZE]={8,3,1,2,6,0,9,7,4,5}; puts("Answer is:"); someFunction(a, 0, SIZE); puts(""); } void someFunction(const int b[], size_t startIndex, size_t size) { if(startIndex < size){ someFunction(b, startIndex +1, size); printf("%d ",b[startIndex]); } }
Problem 1 A. Consider the following recursive method. def foo1(n):  if n == 2: return 1 else: return 3 * foo1(n – 1) What value is returned as a result of the call foo1(5)? Show the recursive calls generated. B. Consider the following recursive method. def foo2(n):  if n > 0: print(n, end=’ ‘) foo2(n-1) What is the output of the call foo2(5) Problem 2 Make sure your code is readable and well-documented. Each function must also begin with a title block that describes the task of the function, input parameters and return value. Write a recursive function that takes a string as an input and returns the reverse of the string. 2. Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: * e de cde bcde abcde Method call rec_string(‘abc’), will…
I need to create an UML digram from the following code: import java.util.Scanner;//Code Provided For Project Two.class Main {public static void main(String[] args) {Scanner input = new Scanner(System.in);System.out.print("Enter the first complex number: ");double a = input.nextDouble();double b = input.nextDouble();Complex c1 = new Complex(a, b);System.out.print("Enter the second complex number: ");double c = input.nextDouble();double d = input.nextDouble();Complex c2 = new Complex(c, d);System.out.println("(" + c1 + ")" + " + " + "(" + c2 + ")" + " = " + c1.add(c2));System.out.println("(" + c1 + ")" + " - " + "(" + c2 + ")" + " = " + c1.subtract(c2));System.out.println("(" + c1 + ")" + " * " + "(" + c2 + ")" + " = " + c1.multiply(c2));System.out.println("(" + c1 + ")" + " / " + "(" + c2 + ")" + " = " + c1.divide(c2));System.out.println("|" + c1 + "| = " + c1.abs()); Complex c3 = null;try {c3 = (Complex)c1.clone();}catch (CloneNotSupportedException e)…
C/C++ & MIPS The function ?add(?,?) for two positive integers 0≤?, and 0≤?, is defined as the following:?add(?,0)=?; ?add(?,?)=?add(?,?−1)Write a recursive version of ?add() in C or C++, then use this program to develop a MIPSprogram that gets as input two integers 0<? ≤255, and 0<? ≤255, and returns theresult of ?add(?,?) in $v1.Your deliverable should be the C/C++ code and the MIPS assembly function-code
Consider the following program written in C pseudocode void foo(int x, int y){ y = y + 9; X = X + y; } voidmain(){ int a = 6; int b = 5; foo(a, b); } For each of the following parameter-passing methods, what will be the values of a and b after running the program? Passed by value Passed by reference Passed by value-result 1. a= b= 2. a= b= 3. a= b=
my code is getting errors and i cant figiure out why , can you check my code and help me fix the errors . written in c code. It needs to print out a maze and as you hit enter you go through the maze. #include <stdio.h>#include <stdlib.h> #define XSTART 2#define YSTART 0 #define DOWN 0#define RIGHT 1 #define UP 2#define LEFT 3 void mazeTraverse(char maze [12][12],int xCor,int yCor,int dir);int checkForEdge(int x , int y);int correctMoves (char maze[][12],int r , int c );void displayMaze (char maze [][12]); int main (void){ char maze [12] [12] ={{'#','#','#','#','#','#','#','#','#','#','#','#'}, {'#','.','.','.','#','.','.','.','.','.','.','#'}, {'.','.','#','.','#','.','#','#','#','#','.','#'}, {'#','#','#','.','#','.','.','.','.','#','.','#'}, {'#','.','.','.','.','#','#','#','.','#','.','.'}, {'#','#','#','#','.','#','.','#','.','#','.','#'}, {'#','.','.','#','.','#','.','#','.','#','.','#'}, {'#','#','.','#','.','#','.','#','.','#','.','#'},…
Write Python Code Farmer John is worried for the health of his cows after an outbreak of the highly contagious bovine disease COWVID-19.In order to limit transmission of the disease, Farmer John's N cows ( 2<=N<=105) have decided to practice "social distancing" and spread themselves out across the farm. The farm is shaped like a 1D number line, with M mutually-disjoint intervals (1<=M<=105) in which there is grass for grazing. The cows want to locate themselves at distinct integer points, each covered in grass, so as to maximize the value of D, where D represents the distance between the closest pair of cows. Please help the cows determine the largest possible value of D. INPUT FORMAT (file socdist.in): The first line of input contains N and M. The next M lines each describe an interval in terms of two integers a and b, where 0<=a<=b<=1018. No two intervals overlap or touch at their endpoints. A cow standing on the endpoint of an interval counts as standing on…
What is the output of the following C++ code? #include <iostream>using namespace std;class A{public:A(int n ){cout << n;}};class B: public A{public:B(int n, double d): A(n){cout << d;}};class C: public B{public:C(int n, double d, char ch): B(n, d){cout <<ch;}};int main(){C c(5, 4.3, 'R');return 0;}