1.

Consider the network diagram given in the previous question. Suppose that the road connecting T and R got damaged and therefore, traffic cannot go along that road.Then, the number of distinct ways in which city R can be reached from city Q without going thorough any city more than once is:

A. 3
B. 1
C. 4
D. 2
Answer» E.


Discussion

No Comment Found