A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is:

The postfix expression for the infix expression A + B * (C + D) / F + D * E is:

(a) Consider the relation scheme $$R(A, B, C)$$ with the following functional dependencies:
$$\eqalign{ & A,B \to C \cr & \,\,\,\,\,\,C \to A \cr} $$
Show that the scheme $$R$$ is the Third Normal Form $$(3NF)$$ but not in Boyce-Code Normal Form $$(BCNF).$$

(b) Determine the minimal keys of relation $$R.$$

$$\mathop {Lim}\limits_{x \to \infty } {{{x^3} - \cos x} \over {{x^2} + {{\left( {\sin x} \right)}^2}}} = \_\_\_\_\_\_.$$