CSCB36H3 Final: csc236 mt1a-sol

16. Suppose m and n are both int variables with positive values. Which of the following boolean expressions are guaranteed to be equal in value to the expression that follows? (m % n == 0 && n % m == 0) • I. m == • II. ! (m III. ! (m n n) > n) (A) I and III (B) I, II, and III (C) I and II (D) None of the expressions are guaranteed to be the same. (E) I only

15. What will the following method print when the input number n has value 5 public static void mystery (int n) { for (int i = -1; i < n; System.out.print (i + " ")) { i++; (A) 0 1 2 3 4 5 (B) 01234 (C) -1 0 1 2 3 4 5 (D) -101234 (E) The code does not compile.

Recursion Question 5. In the following question, you will be asked to program the following using recursion. If you have an iterative solution, you may use it, but the most you can get for the question will be half credit. (5) points) Consider the following mathematical function h which operates on integers. (1, if n < 2 h(n) = n(n-1) +n if n > 2 and n is even han -2) +2*n if n > 2 and n is odd In Java, use recursion to write a method h which takes as input an int n and returns h (n). public static int h(int n) {