Permutation and CombinationMedium
Question
A road network as shown in the figure connect four cities. In how many ways can you start from any city (say A) and come back to it without travel ling on the same road more than once ?
Options
A.8
B.12
C.9
D.16
Solution
Paths are shown as : -
Similarly if we start from A towards B we get another 4 paths.
Similarly if we start from A towards B Again 4 paths
∴ Total different paths = 4 × 3 = 12
II Method → 3C1 ×; 2C1 × 2C1 = 12
Similarly if we start from A towards B we get another 4 paths.
Similarly if we start from A towards B Again 4 paths
∴ Total different paths = 4 × 3 = 12
II Method → 3C1 ×; 2C1 × 2C1 = 12
Create a free account to view solution
View Solution FreeMore Permutation and Combination Questions
A candidate is required to answer 6 questions out of 10 which are divided into two groups each consisting of 5 questions...The number of word groups by taking at least 4 letters of each words ′LENGTH′, ′STROKE′ and R...If out of 8 flags, 5 flags are white (identical) and 3 flags are of red colour (identical), then how many signals can be...The number of ways in which first, second and third prize can be distributed among 5 competitors is (no person can get m...How many numbers can be formed with the digits 2,3,5,7,0 which are greater than 70,000 (Rept. not allowed) ?...