Self-Quiz Unit 2: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9694441&cr Dashboard / My courses / CS 3303-01 - AY2023-T3 / 2 February - 8 February / Self-Quiz Unit 2 Started on Monday, 6 February 2023, 10:05 PM State Finished Completed on Monday, 6 February 2023, 10:11 PM Time taken 5 mins 54 secs Grade 10.00 out of 10.00 (100%) Question 1 Correct Mark 1.00 out of 1.00 The upper bound for the growth of the Algorithms running time is represented by: Select one: a. Big Oh (O)V b. Big Omega ((2) c. Big Theta (O) d. Exponential growth The correct answer is: Big Oh (O) Question 2 Correct Mark 1.00 out of 1.00 Asymptotic Algorithm Analysis is primarily concerned with: Select one: a. The size of the constant in the algorithm running time equation b. The speed of the computing running the algorithm c. The speed of the compiler d. The growth rate demonstrated in the algorithm running time equation The correct answer is: The growth rate demonstrated in the algorithm running time equation 1 of 8 4/5/2023, 8:58
Self-Quiz Unit 2: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9694441&cmi ... Question 3 Correct Mark 1.00 out of 1.00 True/False: Big Theta (O) indicates that the Upper and Lower bounds of an algorithm are the same. Select one: True False The correct answer is 'True'. Question 4 Correct Mark 1.00 out of 1.00 For the following code fragment, select the option that represents the most appropriate asymptotic analysis: for (int i = 0; i < a.length; i++) { System.out.println(a[i]); } Option 1. O(n) Option 2. 0( 2 ) Option 3. O( n log n ) Option 4. O(12 ) Select one: a. Option 1V b. Option 2 O c. Option 3 O d. Option 4 The correct answer is: Option 1 2 of 8 4/5/2023, 8:58 PM
Self-Quiz Unit 2: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9694441&cmi ... Question 5 Correct Mark 1.00 out of 1.00 For the following code fragment, select the option that represents the most appropriate asymptotic analysis: for (int i = 1; i <= n; i *= 2) { for (int j = 0; j < n; j++) { count++; } } Option 1. O( 1 ) Option 2. O(2) Option 3. O( n log n ) Option 4. O( 12 ) Select one: a. Option 1 O b. Option 2 O c. Option 3V O d. Option 4 Explanation: Here the outer loop is done log n times and the inner loop is done times, so T(n) = n log n. (Note that the default base for logarithms in Computer Science is 2.) The correct answer is: Option 3 3 of 8 4/5/2023, 8:58 PM