• 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

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.

The time complexity of sequential search is O(n)

Choose 5 starters from a team of 12 players. Order is not important.

12C5= 729

If less work is involved in searching a element than to sort and then extract, then we don’t go for sort

If frequent use of the file is required for the purpose of retrieving specific element, it is more efficient to sort the file.

Thus it depends on situation

Both 2 and 3 are clearly the diadvantages of circular list

There are 8 students and the maximum capacity of the cars together is 9.

We may divide the 8 students as follows

Case I: 5 students in the first car and 3 in the second Or

Case II: 4 students in the first car and 4 in the second

Hence,     in Case I: 8 students are divided into groups of 5 and 3 in 8C3 ways.

Similarly, in Case II: 8 students are divided into two groups of 4 and 4 in 8C4 ways.

Therefore, the total number of ways in which 8 students can travel is

8C3+8C4 = 56 + 70 = 126.