![]() |
.. (לתיקייה המכילה) | |
In Q1, should we prove everything formally and how “formally” should it be? | |
All the connections (Θ,Ω, O) should be proven formally to the extent it was shown in class. However, you are allowed to say things like “log(n) = o(n)” (little “o”) and justify it by the fact that lim log(n) / n -> 0. No one has revoked the basic calculus. |
In Q5, can there be an empty set or a set of size one? | |
Each set must contain between 2 and 5 students (including 2 and 5). In particular, an action that defies this condition should not be executed. |