There are N towns T_1.....T_N and a cost matrix C where is the cost of moving directly from
T_i, to T_f, for I, j^1.....N and = 0 for i= 1...N. Starling from T_i it is required to find the lowest
cost route to T_N. including as many intermediate cities on the route as are required. Show how
this problem may be formulated in terms of Dynamic Programming and show how the method of
successive approximations (e.g., the N point problem) may be used to provide a solution. Taking
care to provide the necessary equations and also describe the necessary steps.
Solution
Dynamic programming is defined as dividing the given main problem into sub problems such
that the solutions defined for these sub problems are used to compute the result of given main
problem.
Now in this problem a function is used to compute the lowest cost edge among all its neighbours
and it is considered as subproblem.
First T1 is sent as input for this subproblem and identifies the low cost route among all its
neighbours and the node selected will be given for this subproblem function and this process
continues untill the final node is reached..
These succesive approximation of finding the smallest route among the neighbours of one node
and based on this value next node will be selected and above process will be done and this will
continue till the selected node is final node ... We can also add concept of backtracking in this
process and identify all possible paths to the destination and then compare all the values and
return the route with lowest cost...
Making communications land - Are they received and understood as intended? we...
Thursday, Friday and Saturday are the busiest nights at the Jopper b.pdf
1. Thursday, Friday and Saturday are the busiest nights at the Jopper bar. Police records show that
on 12 of the last 50 Thursdays, 15 of the last 50 Fridays, and 16 of the last 50 Saturdays they
were summoned to deal with a disturbance at the bar. Construct a tree diagram and use it to find
the probability that over the next Thursday, Friday and Saturday nights there will be:
A) No trouble
C) Trouble o one night only
E) Trouble on two nights only
Assume that events on any one night are independent of events on any other night.
Solution
