Silverlight 1 is purely AJAX and JavaScript based. All the code has to be written in JavaScript and XAML. 

 Silverlight 2 supports managed code. When the Silverlight 2 runtime is installed, it installs a limited version of the .NET runtime on the client machine

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) 

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.

Polish and Reverse Polish are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms

The smallest number in the series is 1000, a 4-digit number.

The largest number in the series is 4000, the only 4-digit number to start with 4. 

The left most digit (thousands place) of each of the 4 digit numbers other than 4000 can take one of the 3 values 1 or 2 or 3.

The next 3 digits (hundreds, tens and units place) can take any of the 5 values 0 or 1 or 2 or 3 or 4.

Hence, there are 3 x 5 x 5 x 5 or 375 numbers from 1000 to 3999.

Including 4000, there will be 376 such numbers.

The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.

fix one person and the brothers B1 P B2 = 2 ways to do so.
other 17 people= 17!

 
Each person out of 18 can be fixed between the two=18, thus, 2 x 17! x 18=2 x 18!