# wegoki

## Find the local maximum and minimum values of f using both the First and Second Derivative Tests. f(x) = 2 + 9x^{2} – 6x^{3}

EXPERT ANSWER f(x) = 2+9x^2-6x^3 f'(x) = 18x-18x^2 = 18x(1-x) = 0 x = 0 , 1 f”(x) = 18-36x f”(0) = 18 , at x = 0 local minimum f”(1) = -18 , at x = 1 local maximum f(0) = 2 , f(1) = 5 local maximum value = 5 . (Answer) local …

## graph by using the first and second derivative tests of f(x)=x^3 + 3x^2 -9x+4

EXPERT ANSWER f(x) = x^3 + 3x^2 -9x + 4 f'(x) = 3x^2 + 6x – 9 = 3(x – 1)(x + 3) f”(x) = 6x + 6 = 6(x + 1) for local extrema f'(x) = 0 , x = -3,1 local maximum value = 31 local minimum value = -1 inflection point => …

## 20. What is the Big-O time complexity for an algorithm to display the nth integer in an array of integers? a. O(n) b. O(n2) c. O(log n) d. O(1)

EXPERT ANSWER What is the Big-O time complexity for an algorithm to display the nth integer in an array of integers? O(n) O(n2) O(log n) O(1)

## 18. When adding an entry to an array-based implementation of the ADT List at the end of the list a. no shift is necessary b. all of the previous elements must be shifted toward the front of the array c. only one element is shifted toward the end of the array to make room d. only one element is shifted toward the beginning of the array to make room 19. When inserting a node between two adjacent nodes in a chain you must locate a. the first node and the node before the insertion position b. the first node and the node after the insertion position c. the last node and the node after the insertion position d. the node before the insertion position and the node after the insertion position

EXPERT ANSWER When adding an entry to an array-based implementation of the ADT List at the end of the list no shift is necessary all of the previous elements must be shifted toward the front of the array only one element is shifted toward the end of the array to make room only one element …

## In an array-based implementation of the ADT List, what is the performance of adding an entry at the end of the list when the array is resized? a. O(n2) b. O(log n) c. O(n) d. O(1)

EXPERT ANSWER In an array-based implementation of the ADT List, what is the performance of adding an entry at the end of the list when the array is resized? O(n2) O(log n) O(n) O(1)

## Assume array size is 50 in a circular array implementation of a Queue; Assume frontIndex is 49 and backIndex is 46; After dequeueing three, ie removing 3 elements, what will the values of backIndex and FrotnIndex be: a. FrontIndex: 49 BackIndex: 46 b. FrontIndex: 47 BackIndex: 46 c. FrontIndex: 49 BackIndex: 44 d. FrontIndex: 2 BackIndex: 46 Answer: 16. In an array-based implementation of a Queue, if waitingList is the name of the array, and the index to the last entry in the queue is called backIndex, which assignment statement updates backIndex to add an entry to the queue: a. backIndex = (backIndex + 2) % waitingList.length; b. backIndex = (backIndex + 1) % waitingList.length; c. backIndex = (backIndex – 1) % waitingList.length; d. backIndex = (backIndex – 2) % waitingList.length;

EXPERT ANSWER Assume array size is 50 in a circular array implementation of a Queue; Assume frontIndex is 49 and backIndex is 46; After dequeueing three, ie removing 3 elements, what will the values of backIndex and FrotnIndex be: a. FrontIndex: 49 BackIndex: 46 b. FrontIndex: 47 BackIndex: 46 c. FrontIndex: 49 BackIndex: 44 d. …