COSC 111 Lecture 5: branching statements and boolean

28. Consider the Cocktail Sort (code 4) algorithm described in the appendix. If we input the array (a= {3,4,1,6,2})', how many times total will the print statements on line 15 and 28 execute. For example, if line 15 happens four times, and line 28 happens five time, then your answer should be 9. (A) O (B) 4 (C) 5 (D) 3 (E) 6

(1) LILI T W IIIL LI , 28. Line 3 (A) int temp = 0; int counter = 2; (B) while (fibi temp) { (C) None of these statements are useful when paired with other questions, leave blank. (D) int temp = fib1+fib2; (E) int temp, counter;{

15. What is printed by the following program? void setup() { func2 (2); func2(func3(3)); void funcl (int x) { println("funcl " + x); void func2(int x) { println("start"); funci (x+3); println("end"); int func3(int x) { println("func3 " + x); return x*10;