Answer:
Explanation:
There are two reasons, first, the operating system could be blocked because a program with poorly written user program does not allow for enough stack space.
Second, the kernel can leave data in the user memory of a program, and this data can be used for another user to get another delicate information.
Answer:
See in Explanation
Explanation:
All you know is that an 
algorithm is eventually (a lot) faster than an 
algorithm, but for any specific value of n, you can't say anything. Indeed, the asymptotic growth of the function doesn't depend on its value on 
. This means that if 
then for all 
, the following function is also :
So asymptotic notation is completely uninformative regarding the performance of algorithms on specific values of n.
You could say that functions such as 
are artificial and never really occur in practice. This is not quite true (you can hard-code some auxiliary information for small n, for example), but even if you consider "natural" functions, asymptotic notation doesn't help you to determine anything other than asymptotic's: consider for example 
against 
(such examples definitely happen in practice, for example in fast matrix multiplication).
I pretty sure you it’s the third one c.
False, think about the people with low vision. Think about the font and what size it would have to be,the color (ex. yellow would not be good), Spacing, tracking etc. Just a few things to consider.
The climax. The climax is when the story peaks and has the most suspense. The story falls closer to it's end after the climax.
