1
AIEEE 2007
+4
-1
The set S = {1, 2, 3, ........., 12} is to be partitioned into three sets A, B, C of equal size. Thus $$A \cup B \cup C = S,\,A \cap B = B \cap C = A \cap C = \phi$$. The number of ways to partition S is
A
$${{12!} \over {{{(4!)}^3}}}\,\,$$
B
$${{12!} \over {{{(4!)}^4}}}\,\,$$
C
$${{12!} \over {3!\,\,{{(4!)}^3}}}$$
D
$${{12!} \over {3!\,\,{{(4!)}^4}}}$$
2
AIEEE 2006
+4
-1
At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are 10 candidates and 4 are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is
A
5040
B
6210
C
385
D
1110
3
AIEEE 2005
+4
-1
If the letter of the word SACHIN are arranged in all possible ways and these words are written out as in dictionary, then the word SACHIN appears at serial number
A
601
B
600
C
603
D
602
4
AIEEE 2004
+4
-1
How many ways are there to arrange the letters in the word GARDEN with vowels in alphabetical order
A
480
B
240
C
360
D
120
EXAM MAP
Medical
NEET