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)
Answer: b
The computer virus is simply a ___
b. Set of computer instructions or code
It's neat organized and ready to find when needed
Answer:
A.Treats array entries as if they were strings that have same length.
Explanation:
The radix sort treats the array values as the strings.First it compares the LSB(Least Significant Bit) of the array values and then moves to the right one by one upto MSB(Most Significant Bit).So we can say that the radix sort treats the entries of the array as strings and compare them.So the answer is option A.
<span>In describing an Initialization is when a value is assigned to a variable as part of the variable's definition or the assinged values to variables are defined whenever.
The best answer would be is that they present the keyword, when they tell the compiler.</span>
