Answer:
The answer of the the following question are 0(n^2)
The total number of multiplication is 2
And the total number of addition is 1
Explanation:
Let the size of the input is the degree of the polynomial = "n"
Than the number of the multiplications depends on "n"
Let the number of multiplication = M(n)
Let the number of addition = A(n)
1): Solution-
M(n) = n∑_{i=0} i∑_{j=1} 2
= 2 n∑_{i=0} i∑_{j=1}
= 2 n∑_{i=0} i-1+1
= 2 n∑_{i=0} i
= 2 * n*(n+1)/2 = n*(n+1)
= n^2 + n ∈ 0(n^2)
2): Solution for addition-
A(n) = n∑_{i=0} i∑_{j=1} 1
= by solving this from the same way it leads to
= n^2 + n and n^2 + n ∈ 0(n^2)
F5 key on your keyboard in word and power point if that is what you are referring to.
Answer: Phreaker
Explanation:
Phreaker is defined as the unauthorized attack on authorized communication system for stealing and manipulation phone networks.
- Exploring,searching and identifying telecommunication field with help of technologies,equipment,tools etc is done to exploit the system and resources .
- Other options are incorrect because phone hacking is attacking phone device, [email protected] is also hacking source and hacktivist hacks system to impact social and political field.
- Thus, the correct option is option(d)
It depends on what you’d need it for.
> Portable Storage <
- Good for traveling.
- Good for porting stuff from a device to another device.
> Internal Storage <
- Better if you are using it for one device.
- Increase device storage.
