5. Find a shortest path between a and z in each of the weighted graphs in Exercises 2–4.

Answer :
- 2 = a,b,e,d,z (7)
- 3 = a,c,d,e,g,z (16)
- 4 = a,b,e,h,I,m,p,s,z (16)
6. Find the length of a shortest path between these pairs of vertices in the weighted graph in
Exercise 3.
a) a and d c) c and f
b) a and f d) b and z
Answer :
- a) 6 c) 8
- b) 11 d) 15
11. Find a shortest route (in distance) between computer centers in each of these pairs of cities in
the communications network shown in Figure 2.
a) Boston and Los Angeles c) Dallas and San Francisco
b) New York and San Francisco d) Denver and New York
Answer :
- a) via Chicago (2596) - c) via Los Angeles (1584)
- b) via Chicago (2577) - d) via Chicago (1630)
12. Find a route with the shortest response time between the pairs of computer centers in
Exercise 11 using the response times given in Figure 2.
Answer :
- a) via Chicago (10 sec) - c) via Los Angeles or via Denver (8 sec)
- b) via Chicago (9 sec) - d) via Chicago or via Dallas (10 sec)
13. Find a least expensive route, in monthly lease charges, between the pairs of computer centers
in Exercise 11 using the lease charges given in Figure 2.
Answer :
- a) via Chicago - c) via Los Angeles
- b) via Chicago - d) via Chicago