Computer Science Archive: Questions from May 09, 2023
-
0 answers
-
0 answers
-
A BNF grammar for expressions is given below: \( \langle \) assign \( \rightarrow \) Semantic rule: 〈expr». expected type \( \leftarrow\langle \) var〉. actual type2 answers -
1. \( F(n)=F(n-1)+F(n-2) \) donde: \[ \begin{array}{l} F(0)=0 \\ F(1)=1 \end{array} \] \[ \begin{array}{l} t(n)=6 t(n-1)+4+(n-2) \\ \text { donde: } \\ t(0)=0 \\ t(1)=4 \sqrt{5} \\ t(n)=6 t(n-1)+4 t(n0 answers -
Using Master Theorem
1. \( F(n)=F(n-1)+F(n-2) \) donde: \[ \begin{array}{l} F(0)=0 \\ F(1)=1 \end{array} \] \[ \begin{array}{l} t(n)=6 t(n-1)+4+(n-2) \\ \text { donde: } \\ t(0)=0 \\ t(1)=4 \sqrt{5} \\ t(n)=6 t(n-1)+4 t(n0 answers -
2 answers