EL ENG 126 Midterm: ee126-sp2006-mt1-Wainwright-soln
Document Summary
Since there is no direct ight from san diego (s) to new york (n), every time alice wants to go to the new york, she has to stop in either chicago (c) or denver (d). Ew through c? (c) (3pt) suppose that alice wants to maximize the probability that she arrives in new york with a total delay < 2 hours. The problem can be modeled as a network having four nodes (s,d,c,s), where sd, Sc, cd and cn are linked (see fig. Also, let us de ne d as the event that alice ies through denver, and c as the event that. Figure 1: network modeling problem 1 (a) there are two possible ways to go to n from s, so using total probability law we have. = e(xsc + xcn )p (c) + e(xsd + xdn )p (d) 2 (e(xsc) + e(xcn ) + e(xsd) + e(xdn ))
