CSE 111 Lecture 39: introduction_to_python_2

24. Consider the Insertion Sort (code 3) algorithm described in the appendix. How can we change this code to have the algorithm sort from largest to smallest instead? (A) Change line 9 to: a[j-1] = a[j]; (B) Change line 7 to: while(j >0 && a[j - 1] 0; i--) (E) Change line 12 to: a[i] = x;

Syscene.UU.VIILIIllesUIL! 8. Consider a method with the header: public static boolean method (int x, boolean y) Is boolean b = method(10+2, true &&0) a valid way to call it? Write YES or NO

38. Imagine we have the following configuration in an instance of graph: If the node 0 is at position 0 in the graph, and we print its content, what would be printed into the console, e.g. System.out.println (graph[0]);?. N.B. The ordering of Nodes written after connected to: is unimportant. (A) 3 is connected to: (B) 1 is connected to: (C) O is connected to: (D) O is connected to: (E) 0 is connected to: 0, 1, 2, 3, 4, 0, 3 1, 3, , 1, 3