Register

GO Classes 2024 | DA Scholarship Test | Question: 19

• retagged by
324 views
4 4 votes
A child going on a trip is told that out of his 8 favorite toys, he can bring at most three toys. The number of ways he could select which toys he brings is
  1. ${ }_{8} P_{0}+{ }_{8} P_{1}+{ }_{8} P_{2}+{ }_{8} P_{3}$
  2. ${ }_{8} C_{0}+{ }_{8} C_{1}+{ }_{8} C_{2}+{ }_{8} C_{3}$
  3. ${ }_{8} C_{3}-\left({ }_{8} C_{0}+{ }_{8} C_{1}+{ }_{8} C_{2}\right)$
  4. ${ }_{8} C_{0} \times{ }_{8} C_{1} \times{ }_{8} C_{2} \times{ }_{8} C_{3}$

1 Answer

1 1 vote
Very easy just select 0,1,2,3 given atmost 3..so let's stop at 3..

It is also mentioned just select so use combination..

8c0 + 8c1 + 8c2 + 8c3 (B) is the answer.
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes 2024 | DA...Next → · Combinatory Pratice ...
← Previous in category · GO Classes 2024 | DA...Next in category → · Combinatory Pratice ...
Position:
Show:

Related questions

4 4 votes
3 3 answers
572
572 views
GO Classes asked Jul 28, 2024
572 views
GO Classes 2024 | DA Scholarship Test | Question: 17
A used video game store has the following titles available for purchaseIf a customer purchases 3 action games, 1 RPG, 2 sports, and 1 classic game, the total number of wa...
3 3 votes
1 1 answer
402
402 views
GO Classes asked Jul 28, 2024
402 views
GO Classes 2024 | DA Scholarship Test | Question: 20
For a pair $(A, B)$ of subsets of the set $X=\{1,2, \ldots, 100\}$, let $A \triangle B$ denote the set of all elements of $X$ which belong to exactly one of $A$ or $B$. T...
3 3 votes
1 1 answer
596
596 views
GO Classes asked Jul 28, 2024
596 views
GO Classes 2024 | DA Scholarship Test | Question: 21
Twelve clay targets (identical in shape) are arranged in four hanging columns, as shown in figure below. There are four red targets in the first column, three white ones ...
51 51 votes
6 answers 6 answers
13.8k
13.8k views
Misbah Ghaya asked Nov 29, 2016
13,835 views
GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.