# CSE - Questions and solutions set-15

Computer science and engineering(CSE) - Question & solution set-15
Question:-
Option (A)
40
Option (B)
30
Option (C)
12
Option (D)
48
Correct Option:
A
Question Solution:
a0 + a1 + a2 + a3 + a4 + a5 + a6 + a7 + a8 + a9+ a10 + a11 = 120
If we group 4 a's at a time, we get
(a0 + a1 + a2 + a3) + (a4 + a5 + a6 + a7) + (a8 + a9 + a10 + a11) = 120
g1 + g2 + g3 = 120
So at least one gi has to be atleast 40 by pigeon hole principle.
Question:-
Option (A)
Option (B)
Option (C)
Option (D)
Correct Option:
D
Question Solution:
=
(use L'hospital's rule)
= =
Question:-
Option (A)
Option (B)
Option (C)
Option (D)
None of these
Correct Option:
B
Question Solution:
"Nobody can ignore her” is same as "it is not true that there is a person who can ignore her” which can be represented in symbolic form as .
Note that choice (a) means "somebody can ignore her”. Choice (c) means "everybody can ignore her”.
Question:-
Option (A)

Option (B)
29
Option (C)

Option (D)
Correct Option:
B
Question Solution:
The correct answer is 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2 = 29 because we want to count all the different ways, we can choose some subset of n things, we get the answer 2n.
A common incorrect answer would be . It is the number of ways we could permute the 9 toppings on burger like "first lettuce, then tomato, then mustard, then pickle”, etc., would be one permutation and a different permutation would be "first tomato, then lettuce, then mustard, then pickle etc.