Blog

  MI Rutina Estudiantil – Quiz Instructions You will introd…

  MI Rutina Estudiantil – Quiz Instructions You will introduce yourself to a classmate in an email format. Write a short paragraph in Spanish following the directions below. You must cover all of the points listed: Include in your paragraph: Your name. Your major and where you go to school (say: la Universidad de Valencia for Valencia College). The courses you are taking, including days and times. Just write about the Spanish class. Where you work (if you have a job). If you do not work, write that you do not. Something you do when you are not working or studying. One sentence using GUSTAR to share some of your likes or dislikes. Ask one question to your classmate. Say goodbye. Type your word count at the end. No English!!! Requirements: Minimum: 50 words. Use at least 6 different conjugated verbs in the present tense. Write in complete sentences. Only use present tense verbs. If you use a verb tense that has not been taught in class: –3 points for each incorrect tense. If an incorrect tense is used 4 or more times, the assignment will receive a 0. Assignments that use an online translator, AI tool, or the help of a native speaker will receive no credit. (Canvas shows when this happens.) Helpful tip: To type accent marks and Spanish punctuation, copy and paste from here: á  é  í  ó  ú  ñ  ¿  ¡  É

Caribe Construction Company produces n construction items. I…

Caribe Construction Company produces n construction items. Item i weighs W[i] pounds, and sells at price C[i]. CCC has m distributors around the globe. Distributor j has the capacity to move K[j] pounds at a time. Each distributor wants to buy a collection of items such that the profit is maximized. Design a dynamic programming algorithm to obtain the max profit of each distributor. Your input is an array of weights W[1…n], an array of prices C[1…n], and an array of capacities K[1…m]. Example: Caribe Construction Company Items: W = [1, 2, 3]C = [4, 9, 6] Distributor Capacities: K = [2, 3, 5] Output = [9, 13, 22] Please answer the following parts: Define the entries of your table in words. E.g. T(i) or T(i, j) is … State a recurrence for the entries of your table in terms of smaller subproblems.  Don’t forget your base case(s). Analyze an implementation of this recurrence:         A. State the number of subproblems in big-O notation.         B. State the runtime to fill your table using your recurrence from part 2.         C. State how the return is extracted from your table.          D. State the runtime of that return extraction.