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
If all the letters of the word ″QUEUE″ are arranged in all possible manner as they are in a dictionary, then...Passengers are to travel by a double decked bus which can accommodate 13 in the upper deck and 7 in the lower deck. The ...The number of ways of arranging the letters AAAAA, BBB, CCC, D, EE & F in a row if the letter C are separated from one a...2nPn is equal to...A basket contain 4 oranges, 5 apples and 6 mangoes. In how many ways can a person make a selection of fruits, if atleast...