Compulsory Task 1 Answer the following questions: Dev What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i=1;i<= n; i++) sum = sum + 1* (i + 1); What is the Big-O notation of the following algorithm (assume that all variables have been declared): for (int i = 5; i <= 2 * n; i++) System.out.println(2 * n + i - 1); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= 2 * n; i++) for (int j = 1; j <= n; j++) System.out.println(2* i + j); System.out.println(" "); • What is the Big-O notation of the following algorithm: for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) Copyright © 2021 Hyperion Dev. All rights for (int k = 1; k <= n; k++) System.out.println(i + j + k); Each of the following expressions represents the number of inputs for certain algorithms. Write them in Big O notation (eg, n+2+ O(n)); on² + 6n + 4 5n² + 2n + 8 (n² + 1) (3n+ 5) o 5(6n + 4) O n+ 2logn - 6 o4nlogin + 3n + 8

Divide and Conquer is one of the important design method for Algorithm. What is the major feature to design an algorithm applying the Divide and Conquer idea ? 單選: a. Recursive in Assign, Calculate, Output. O b. Recursive in Assign, Divide, Conquer. O c. Recursive in Divide, Calculate, Combine. d. Recursive in Divide, Conquer, Combine. e. Recursive in Calculate, Conquer, Combine. We call it as 3C.

n-1 Geometric (n) = i=1 i=1 1 1 * n-1 П %3D Harmonic (n) = i=1 n Let's look at examples. If we use n = 4, the geometric progression would be 1 * 2 * 3 * 4 = 24, and the harmonic 1.1.1 1 progression would be 1* -= 0.04166. 2 3 4 24 Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println ("Method call -- " + "calculating " "Factorial of: " + n); + Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return (factorial (n - 1) * n); c. Add these lines in the recursive section: temp = factorial (n - 1); System.out.println ("Factorial of: " (n - 1) + " is " temp); return (temp * n); 3. Rerun the program and note how the recursive calls…

Describe the security implications of jailbreaking or rooting a mobile device.