Bonus:  (number your answers)  1) How many of Jesus’ apostle…

Bonus:  (number your answers)  1) How many of Jesus’ apostles died a violent death?  2) What year was Julius Caesar assassinated?  3) Which emperor ordered Masada to be taken by the Romans?  4) What year was the temple destroyed by the Romans?  5) What is the difference in the beliefs of Judaism and Christianity? 

You have a machine that converts water into wine. Even bette…

You have a machine that converts water into wine. Even better, if you feed the machine tons of water, it will produce tons of wine. You have a water storage tank with capacity tons. Unfortunately, the tank is malfunctioning, and whenever you open it to drain some water, you cannot close it again until all the water has drained out. Each day, if the tank contains tons of water, youcan either feed the machine all tons of water in the tank, or you can pump 1 additional ton of water into the tank (if ). On day the demand for your wine is tons. Any wine you produce will spoil by the next day, so if you feed the machine tons of water on day , you will sell  tons of wine, and any wine that does not sell will go to waste. Create a dynamic programming algorithm to determine the maximum amount of wine you can sell over the next days.. You should use a

Alice is playing a game with Bob where they are competing to…

Alice is playing a game with Bob where they are competing to get the smallest score. They start with a large number with digits. Alice starts by removing either the first digit or the last digit from the number, and adding that to her score. Bob continues by doing the same thing to the new -digit number. They continue taking turns removing digits until there are no more digits in the number. Assume both players play optimally. Example: Let the number they’re playing with be which has digits. The optimal score for Alice (who starts the game) will be 11 (digits 9, 2), whereas Bob scores 14 (digits 5, 9). We can let be the optimal score of Alice when her turn starts and there are digits through of left. The goal is to design an efficient dynamic programming algorithm to compute the optimal score Alice can achieve. The table has size

Choose the appropriate verb from the drop-down menu. Avoid u…

Choose the appropriate verb from the drop-down menu. Avoid using the same verb twice. ほんを hon o                           おんがくを ongaku o           うちに uchi ni                              がっこうに gakkou ni            おちゃを ochia o                      はんばーがーを hanbaagaa o             としょかんで toshokan de                   てれびを terebi o                                                   

(lecture; Chapter 11) In class we discussed the “staircase m…

(lecture; Chapter 11) In class we discussed the “staircase model” of terrorism, which contains six floors (ground floor to fifth floor). Briefly describe any THREE of these floors and number them (1 point each: 0.25 point for correctly naming and numbering the floor and 0.75 point for correctly describing the floor; 0.25 point for only providing an example of the floor). If you describe more than three floors, only the first three will be graded. Responses to “short answer” questions should be short (e.g., 1-3 sentences).