Register

CMI2021-A: 8

• edited by
271 views
0 votes
0 votes

There is a basket full of apples, oranges, mangoes, pears and pomegranates. You want to pick three fruits from the basket. Multiple pieces of the same fruit can be picked. However, if you pick mangoes, you cannot pick apples.

In how many ways can you pick three fruits satisfying this condition?

  1. $14$

  2. $40$

  3. $28$

  4. $20$

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
admin asked Jul 22, 2022
275 views
CMI2021-A: 1
If the milkman doesn’t deliver milk or the geyser doesn’t work, then Akash will be late for school and lunch will be cooked late. Suppose lunch was actually cooked on time. Which of the following is definitely true? Akash was late for school Akash reached school in time Geyser worked Milkman did not deliver milk
If the milkman doesn’t deliver milk or the geyser doesn’t work, then Akash will be late for school and lunch will be cooked late. Suppose lunch was actually cooked on...
User Avatar
0 votes
0 votes
0 answers
2
admin asked Jul 22, 2022
182 views
CMI2021-A: 2
Let $\text{L}$ be the language over $\left \{ a, b \right \}$ that contains the same number of occurrences of $a$ and $b$. Which of the following languages is regular? $\text{L} \cap a^{\ast}b^{\ast}$ $(\text{L} \cap a^{\ast}b^{\ast}) \cup a^{\ast}b^{\ast}$ $\text{L} \cup a^{\ast}b^{\ast}$ $(\text{L} \cap a^{\ast}b^{\ast}) \cup b^{\ast}a^{\ast}$
Let $\text{L}$ be the language over $\left \{ a, b \right \}$ that contains the same number of occurrences of $a$ and $b$. Which of the following languages is regular?$\t...
User Avatar
0 votes
0 votes
0 answers
3
admin asked Jul 22, 2022
172 views
CMI2021-A: 3
Which of the following regular expressions represents binary strings that are multiples of $3?$ Note that we consider the leftmost bit to be the most significant. $((11)0^{\ast})^{\ast}$ $(10^{\ast})^{\ast}$ $1(01^{\ast})^{\ast}$ $(11+101^{\ast}01+0)^{\ast}$
Which of the following regular expressions represents binary strings that are multiples of $3?$ Note that we consider the leftmost bit to be the most significant.$((11)0^...
User Avatar
Link Copied!