Question 1 |

There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that:

The fastest computer gets the toughest job and the slowest computer gets the easiest job.

Every computer gets at least one job.

The number of ways in which this can be done is ___________.

The fastest computer gets the toughest job and the slowest computer gets the easiest job.

Every computer gets at least one job.

The number of ways in which this can be done is ___________.

18 | |

36 | |

65 | |

27 |

Question 1 Explanation:

Question 2 |

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L's are indistinguishable, is ______.

120 | |

24 | |

36 | |

12 |

Question 2 Explanation:

Question 3 |

The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is
______________.

135 | |

350 | |

271 | |

335 |

Question 3 Explanation:

Question 4 |

The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is____________.

10 | |

15 | |

18 | |

12 |

Question 4 Explanation:

Question 5 |

The number of divisors of 2100 is _____ .

28 | |

34 | |

36 | |

40 |

Question 5 Explanation:

Question 6 |

The number of bit strings of length 8 that will either start with 1 or end with 00 is?

32 | |

128 | |

160 | |

192 |

Question 6 Explanation:

Question 7 |

The number of distinct positive integral factors of 2014 is ____

4 | |

8 | |

9 | |

10 |

Question 7 Explanation:

Question 8 |

A pennant is a sequence of numbers, each number being 1 or 2. An n-pennant is a sequence of numbers with sum equal to n. For example, (1,1,2) is a 4-pennant. The set of all possible 1- pennants is {(1)}, the set of all possible 2-pennants is {(2), (1,1)}and the set of all 3-pennants is {(2,1), (1,1,1), (1,2)}. Note that the pennant (1,2) is not the same as the pennant (2,1). The number of 10- pennants is _____.

1024 | |

89 | |

156 | |

112 |

Question 8 Explanation:

Question 9 |

There are 5 bags labelled 1 to 5. All the coins in a given bag have the same weight. Some
bags have coins of weight 10 gm, others have coins of weight 11 gm. I pick 1, 2, 4, 8, 16
coins respectively from bags 1 to 5. Their total weight comes out to 323 gm. Then the product
of the labels of the bags having 11 gm coins is ___.

12 | |

10 | |

16 | |

8 |

Question 9 Explanation:

Question 10 |

In how many ways can b blue balls and r red balls be distributed in n distinct boxes?

\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!} | |

\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!} | |

\frac{n!}{b!\,r!} | |

\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)} |

Question 10 Explanation:

There are 10 questions to complete.