$[$Please Provide spesific answer because the time isshort for me$]$

Let $f$ and $g$ be functions with parameter $n$ and let $c$ and $d$ be constants $).$ Which of

the following assertions hold according to the computation rules in the $O-$calculus:

$O(f*g)=O(f)+O(g)$

$O(c*f)+O(d*f)=O(f)$

$(ginO(f{)}^{{?}^{?}}$gin$(f))>$gin$(f)$

Concerning relational databases, a primary key attribute can contain NULL if it is not declared

as NOT NULL.

True

False

Give a regular expression for the set of all words over the alphabet $\{a,b,c\}$ that contain precisely

two $a-$letters and no $c-$letter between these two $a-$letters.

Which of the properties below hold on the language $\{0^n{1}^n|ninN\}$ over the alphabet $\{0,1\}.$

$($Assume that $PNP.)$

What is the minimal time complexity class of the following program fragment?

You can assume that ody : is executed in constant time.

For every natural number $n,$ including $0,$ let $P(n)$ be some property that can be true or false.

Which of the following statements imply that $P(n)$ is true for all $n?$

$P(0)$ is true, and for all $n,P(n)$ implies $P(n+1).$

$P(0),P(1)$ are true, and for all $n,P(n)$ implies $P(n+2).$

$P(0)$ is true, and for all $n,P(n+1)$ implies $P(n+2).$

Let $x$ be a random variable. Which of the following are equal to the variance of $x?$

Hint: $E[*]$ denotes the expected value.

Which of the following assertions are true for any functions $f,g,h$:$NN?$

$Iff=O(g)$ and $g=(h)$ then $f=(h).$

$Iff=O(g)$ and $g=O(h)$ then $h=O(f).$

$Iff=O(g)$ and $g=O(h)$ then $f=O(h).$

Assume $f$:$NN.$ Which of the following are true?

If $f$ is injective, it has a partial inverse $f^{-1}$ that is surjective.

If $f$ is bijective, so is $f^{-1}$