CSE $260$ Fall $2024-$ Mid$-$term Exam $2($Version A$)$

Dr$.$ Borzoo Bonakdarpour

Total Points $70/$ All questions must be answered

Name: $q,$ MSU NetID: $q,$

$(10$pt$)$ False or true?

$q,$ Let A and $B$ be two sets. It is always the case that:

$|AB|=|A|+|B|.$

Let A and $B$ be two sets. It is always the case that:

$AB=BA$

Let $f$:$xY$ be an invertible function. It is always the case that $f$@$f^{-1}$ is the identity function on $x.$

An algorithm whose running time is $(n^2)$ is inefficient compared with another algorithm whose running time is $O(nlogn).$

Let $R$ be a relation. If $R$ is not irreflexive, then it is reflexive.

$1$