Permutation and CombinationHard
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
The number of permutations formed without changing the position of vowel and consonants of the letters of word ′AL...The number of words which can be formed by using the letters of the word ′INDEPENDENCE′ so that both D occur...The letters of the word "UDAYPUR" are written in all possible ways with or without meaning and these words are arranged ...A bag contains 6 different white and 5 different black balls. 4 balls are drawn at a time. The number of ways in which a...Number of ways of placing 5 different balls in 3 different boxes (no box remains empty), is ---...