Java Multiple Choice

19. When search an array for a particular value, which case is most useful? a. b. c. d. the average case the best case the worst case none of the above 20. If an algorithm requires 7 basic operations for an algorithm with a problem size of n, the algorithmic complexity is 0(7) 0(n) b. C. e. 21. Given fn 3n246 what is g(n)? b. e(n) (5n2) 22. What is the time complexity of the following if statement? if (condition) else Sa a. the complexity of the condition plus the larger of the complexity of S or S2 b. the complexity of the condition c. the larger of the complexity of Si or S d. the complexity of the condition plus the the complexity of S, and the complexity of S2 23. The effect of doubling the input size on an algorithm with time complexity O(n3) is a. 8 times b. 3 times c. double d. negligible 24. The effect of doubling the input size on an algorithm with time complexity O(log n) is a. negligible b. 2 log n c. double d. there is no effect 25. What is the time complexity for adding an entry to a fixed-size array-based bag ADT? b. O(n) C. 0(n2) d. negligible 26. What is the best-case time complexity for searching a fixed-size array-based bag ADT for a particular entry? b. c. d. O(n) O(n2) negligible