# CMI2020-A: 4

17 views

In a class, every student likes exactly one novelist and one musician. If two students like the same novelist, they also like the same musician. The class can be divided into novelist groups, each group consisting of all the students who like one novelist. Similarly, musician groups can be formed. So each student belongs to one musician group and one novelist group. Which of the following is a valid conclusion?

1. There are more musicians groups than novelist groups
2. There are at least as many novelist groups as musician groups
3. For every musician group, there is a bigger novelist group
4. For every novelist group, there is a musician group of the same size
in Others
edited

## Related questions

1
20 views
Consider the procedure $\text{MYSTERY}$ described in pseudocode below. The procedure takes two non-negative integers as arguments. For a real number $x$ the notation $[x]$ denotes the largest integer which is not larger than $x$. $\text{MYSTERY (p,q)}$ $\textbf{if}\;p==0$ ... $MYSTERY(100,150)$? In general, what does $MYSTERY(m,n)$ return for $m,n\underline> 0?$ Justify your answer with a proof.
Which of the following languages over the alphabet $\{0,1\}$ are $not$ recognized by deterministic finite state automata $(DFA)$ with $three$ states? Words which do not have $11$ as a contiguous subword Binary representations of multiples of three Words that have $11$ as a suffix Words that do not contain $101$ as a contiguous subword
Consider the following regular expressions over alphabet$\{a,b\}$, where the notation $(a+b)^+$ means $(a+b)(a+b)^*$: $r_1=(a+b)^+a(a+b)^*$ $r_2=(a+b)^*b(a+b)^+$ Let $L_1$ and $L_2$ be the languages defined by $r_1$ and $r_2$, respectively. Which of the following regular expressions define $L_1\cap L_2$ ... $(a+b)^*a\;b(a+b)^*$ $(a+b)^*b(a+b)^*a(a+b)^*$ $(a+b)^*a(a+b)^*b(a+b)^*$