Question

5. You are designing a flight scheduler for a travel service such as Expedia. A passenger will request a departure time and departure city, D, C, and an arrival time and arrival city A, CA You wll have access to a list of flights, F1.. .Fn, each with an origin city, departure time, destination city, arrival time, and cost. You want to find the flights that will allow the passenger to leave CD no earlier than time D and arrive in Ca no later than A, that has the smallest total cost. Give a more precise formalization of this problem, giving instance format, solution format, constraints, and objective function. Then design and analyze an efficient algorithm for this problem. (3 points, problem specification; 4 points, correct algorithm and correctness proof; 3 points, efficiency and time analysis)

Please show work clearly. Thanks!

Answer 1

Given that, n=15 p-0 8 and q=1-p= 1-0 8-0 2 Here X Binom(n,p) Mean-EX-np -15(0.8) = 12 Variance = Var (X) = npq 15(0.8)(0.2) =2.4 Standard deviation of Xis, SD(X)=V' ar(X) 24 = 1.549