ESSE 2360 Lecture 11: Note Oct 3, 2016

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

20. How many arrays are created in the following code? int[] foo = {1,2,3); int[] bar = foo; int[] m = foo; m = new int [10); int[] copyOfM = m;

Implement the following multiple output combinational logic circuit using a 4 line to

16-line decoder: F1= ∑m (0, 1, 4, 7, 12, 14, 15) F3= ∑m (2, 3, 7, 8, 10)

 F2= ∑m (1, 3, 6, 9, 12) F4= ∑m (1, 3, 5)