80%(5)4 out of 5 people found this document helpful
This preview shows page 17 - 18 out of 18 pages.
Physics background: if our velocity isvbefore we start firing a single rocket whose acceleration isathen, aftertseconds, we will have traveled a totalvt+12at2meters during that time, and our finalvelocity will bev0=v+at.(a) Suppose we have two rockets, witha1=2,s1=1,a2=3,s2=2. How far do we travel if wefire rocket 1 then rocket 2?How far do we travel if we fire rocket 2 then rocket 1?(b) (Part (b) is optional. You can skip it. Only do it if you get stuck on parts (c) and (d) and needa hint.)Suppose we have two rockets, witha1=6,s1=3,a2=4,s2=7. How far do we travel if wefire rocket 1 then rocket 2? Leave your answer as an unevaluated expression.How far do we travel if we fire rocket 2 then rocket 1? Leave your answer as an unevaluatedexpression.Circle the terms in common to both answers. Can they be ignored for our purposes?
(c) What algorithm design paradigm is most appropriate for finding the optimal order to fire therockets? Circle one of the following.(a) Divide-and-conquer(b)Greedy algorithm(c) Dynamic programming(d) Linear programming(e) Reduce to network flow(f) None of the above(d) Design an algorithm to determine the optimal order to fire the rockets. Show your pseudocode.(You don’t need to provide anything other than your pseudocode.)Solution: