Question.2930 - 1. Determine how far a fire truck would travel from each station to every Regional Demand Point. Hint: Assume city streets are laid out in a rectangular grid and vehicles always travel in a North-South or East-West direction (there are no angled streets). 2. If you know the distance that a fire truck travels, how can you predict the time required to travel that distance? Develop a method to predict the time required for any distance that a fire truck might travel. Hint: Use the sample runs in Figure 2: One such predictive expression would take the form:3.Make a table showing the response time for every Regional Demand Point from every station. Which Regional Demand Points are not covered by any existing station within five minutes? Within six minutes? Within seven minutes 4. What is the minimum number of stations that can cover all Regional Demand Points within four minutes? Within five minutes? Within six minutes? Within seven minutes?
Answer Below:
Questions xxxxxxxxx how xxx a xxxx truck xxxxx travel xxxx each xxxxxxx to xxxxx Regional xxxxxx Point xxxx Assume xxxx streets xxx laid xxx in x rectangular xxxx and xxxxxxxx always xxxxxx in x North-South xx East-West xxxxxxxxx there xxx no xxxxxx streets xxxxxxxx Given xxxx the xxxx streets xxx laid xxx in x rectangular xxxx So xxx sum xx the xxxxxxxx value xx the xxxxxxxxxx between xxx and xxxxxxxxxxx of xxxxxxxx and xxxxxxxx Demand xxxxx will xxxxx the xxxxxxxx between xxx specific xxxxxxx and xxx RDP xxx example xxx Station x and x RDP x and x Distance xxxxxxx Station xxx RDP xxx ndash xxx ndash xxxxx distance xxxxxx be xxxxxxxx we xxxx the xxxxxxxx value xx the xxxxxxxx between xxxxxxx and xxx is xxxxxxxxxx in xxx similar xxx the xxxxxxxx between xxxx station xxx RDP xx given xx Station xxxxxxx Station xxxxxxx Station xxxxxxx RDP xxx RDP xxx RDP xxx RDP xxx RDP xxx RDP xxx RDP xxx RDP xxx RDP xx you xxxx the xxxxxxxx that x fire xxxxx travels xxx can xxx predict xxx time xxxxxxxx to xxxxxx that xxxxxxxx Develop x method xx predict xxx time xxxxxxxx for xxx distance xxxx a xxxx truck xxxxx travel xxxx Use xxx sample xxxx in xxxxxx One xxxx predictive xxxxxxxxxx would xxxx the xxxx TIME xxxxxxx CONST xxxxxxxxxxx x xxxxxxxx MILES xxxx you xxxx developed xxxx an xxxxxxxxxx from xxx available xxxx is xxxx solution x valid xxxxxxxxxx for xxx time xx so xxx If xxx why xxx Are xxxxx expressions xxxx valid xxxxxxx and xxxxxxx if xxxxxxxxxx Solution xxx us xxx the xxxxx method xx find xxx distance xxxxxxx the xxxxxxxxx station xxx the xxxx So xx have xxx example xxxxx that xxxxxxx X xxx Y xxxxx and xxxxx Distance xxx ndash xxx ndash xxxx distance xxxxxxx the xxxxx address xxx station xx Thus xxxxxxxx between xxx addresses xxx the xxxxxxxx are xx follows xxxxxxx Station x Station x Add-X xxxxx Distance xxx we xxx use xxxx of xxxx fit xx derive xx expression xxx this xxx us xxxx the xxxx by xxxxxx the xxxxxxxx travelled xx X xxxx and xxx time xxxxx in x axis xxx data xxx the x and x axis xx Distance x Time x The xxxxx and xxx line xx best xxx are xxxxx in xxx following xxxxx TimeTime xxxxxx Time xxx the xxxxxxxx is xx could xx checked xxxx all xxx points xxx close xx the xxxx of xxxx fit xx the xxxxx equation xxxxxxxxxx time xx minutes xxx is xxxxxxxx in xxxxx So xxxx equation xxxx the xxxx best xx the xxxxxxxxxx is xxxxx for xxxx Make x table xxxxxxx the xxxxxxxx time xxx every xxxxxxxx Demand xxxxx from xxxxx station xxxxx Regional xxxxxx Points xxx not xxxxxxx by xxx existing xxxxxxx within xxxx minutes xxxxxx six xxxxxxx Within xxxxx minutes xxxxxxxx In xxxxx to xxxxxxxxx the xxxxxxxx time xxx every xxx let xx use xxx linear xxxxxxxx found xx part xxx linear xxxxxxxx is xxx following xxxxxxxx gives xxx response xxxx for xxxxx RDP xxxx every xxxxxxx RDP xxxxxxx Station xxxxxxx Station xxxxxxx Station x Response xxxx td xxxxxxxx time xx Response xxxx td xxxxxxxx time xx Response xxxx td xxxxxxxx time x From xxx above xxxx we xxx say xxx following xxxx that xxx not xxxxxxx within xxxxxxx from xxx one xx the xxxxxxxx are xxx RDP xxx that xxx not xxxxxxx within xxxxxxx from xxx one xx the xxxxxxxx is xxx All xxx RDPs xxx connected xxxx any xxx of xxx stations xxxxxx minutes xxxx is xxx minimum xxxxxx of xxxxxxxx that xxx cover xxx Regional xxxxxx Points xxxxxx four xxxxxxx Within xxxx minutes xxxxxx six xxxxxxx Within xxxxx minutes xxxxxxxx Checking xxxx we xxx infer xxxx the xxxxxxxx stations xxxxxx cover xxx Regional xxxxxx points xxxxxx four xxxxxxx five xxxxxxx and xxx minutes xxx let xx check xxx minimum xxxxxx of xxxxxxxx that xxx cover xxx the xxxx within xxxxx minutes xxx following xxxxx enumerates xxx stations xxxx can xxxxx each xxxx that xxx cover xxxxxx minutes xxx Stations xx seven xxxxxxx the xxxx and xxx be xxxxxxx by xxx stations xxxxxxx Station xxx Station xxxxx Stations xxxx cover xxxx and xxx only xxx left xx RDP xxxxxxxx and xxxx connect xx Thus xxx the xxxx can xx covered xxxx just xxxxxxxx namely xxxxxxx Station xxxxxxx and xxxxxxx within xxxxx minutes xxxxxxxxx the xxxxxxx number xx Stations xxxx could xxxxxxx all xxx RDPs xxxxxx seven xxxxxxx is xxxxMore Articles From Maths
.ico)
.ico)
.ico)
.ico)
