1. Respond to the following exercises related to various applications in section 2.7. (a) Let f(x)...

Transcribed Image Text:

1. Respond to the following exercises related to various applications in section 2.7. (a) Let f(x) be the number (in thousands) of computers sold when the price is x hundred dollars per computer. Interpret the statements f(12)= 50 and f'(12)= -3. Write in complete sentences. (b) From part (a), estimate the number of computers sold if the price is set at $1300 per computer. (c) If the company found that the revenue function for selling computers x is given by R(x)=6x +14x + 20 (thousand dollars), find the marginal revenue at production level x = 7. Node Definition of the structure Establish the connectivity between Nodes through the .next.next.next Basic methods/functionality: print, size, toString () Identify that the Node is useful only for demonstration purposes but not useful for multiple values to process, that is why we need the automatic mechanism, i.e., the linked list. Regular Linked List and Recursive Linked List Definition of the Data Structure Methods: is Empty(), add (e), add (e,p), print (), size (), find (), findMin (), addInTheMiddle (), printEvens (), printOdds (), printReverse (), Double/Circular Linked List Theory: Trade-offs about using these implementations. Difference between each implementation (e.g., DNode, Node, recursive, wrap-around) The idea of circular data structures was discussed on the Queue section with circular array remove (s), remove (index), findMax (), 1. Respond to the following exercises related to various applications in section 2.7. (a) Let f(x) be the number (in thousands) of computers sold when the price is x hundred dollars per computer. Interpret the statements f(12)= 50 and f'(12)= -3. Write in complete sentences. (b) From part (a), estimate the number of computers sold if the price is set at $1300 per computer. (c) If the company found that the revenue function for selling computers x is given by R(x)=6x +14x + 20 (thousand dollars), find the marginal revenue at production level x = 7. Node Definition of the structure Establish the connectivity between Nodes through the .next.next.next Basic methods/functionality: print, size, toString () Identify that the Node is useful only for demonstration purposes but not useful for multiple values to process, that is why we need the automatic mechanism, i.e., the linked list. Regular Linked List and Recursive Linked List Definition of the Data Structure Methods: is Empty(), add (e), add (e,p), print (), size (), find (), findMin (), addInTheMiddle (), printEvens (), printOdds (), printReverse (), Double/Circular Linked List Theory: Trade-offs about using these implementations. Difference between each implementation (e.g., DNode, Node, recursive, wrap-around) The idea of circular data structures was discussed on the Queue section with circular array remove (s), remove (index), findMax (),