Alter database backup control file to trace

This question is a combination since order is not important.

Answer = 7C3 = 126

Maximim number of triggers that can be applied to a single table is 12

Possibilities     Bowlers      Batsmen         Number of ways

                         6               9

         1              4                7              (6C4*9C7)

         2              5                6              6C5*9C6

         3              6                5              6C6*9C5

6C4*9C7 = 15 x 36 = 540

6C5*9C6 = 6 x 84 = 504

 6C6*9C5= 1 x 126 = 126

Total = 1170

• Mac OS 


• Windows Vista 


• Windows XP SP2 


• Windows 2000 


• Windows Server 2003 


• Linux (Moonlight) 

Here clock-wise and anti-clockwise arrangements are same.

Hence total number of circular–permutations: 18P122*12 = 18!6*24

No.Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

The toys are different; The boxes are identical 

If none of the boxes is to remain empty, then we can pack the toys in one of the following ways 

a. 2, 2, 1 

b. 3, 1, 1 

Case a. Number of ways of achieving the first option 2 - 2 - 1 

Two toys out of the 5 can be selected in 5C2 ways. Another 2 out of the remaining 3 can be selected in 3C2 ways and the last toy can be selected in 1C1 way. 

However, as the boxes are identical, the two different ways of selecting which box holds the first two toys and which one holds the second set of two toys will look the same. Hence, we need to divide the result by 2 

Therefore, total number of ways of achieving the 2 - 2 - 1 option is ways 5C2*3C2= 15 ways

Case b. Number of ways of achieving the second option 3 - 1 - 1

Three toys out of the 5 can be selected in 5C3 ways. As the boxes are identical, the remaining two toys can go into the two identical looking boxes in only one way.

Therefore, total number of ways of getting the 3 - 1 - 1 option is 5C3 = 10 = 10 ways.

Total ways in which the 5 toys can be packed in 3 identical boxes

= number of ways of achieving Case a + number of ways of achieving Case b= 15 + 10 = 25 ways.