D that is the answer but I need 20 words to send this text
Answer:
Running time of algorithm is O(n).
Explanation:
n is power of 2
n =2,4,8,16,32,...................................
A is an array having n elements
B is an array of size 0 to (n/2)-1
if n=4 B then (4/2)-1 =1 So B has size 2
for(i=0;i<=(n/2)-1;++)
{
B[i]=A[2i]+A[2i+1];
}
This for loop will run n/2 times so complexity in terms of Big Oh is O(n/2) =O(n)
Running time of algorithm is O(n).
Converting a decimal number into binary would be:
192/2= 96 remainder=0
96/2= 48 remainder=0
48/2=24 remainder=0
24/2=12 remainder=0
12/2=6 remainder=0
6/2=3 remainder=0
3/2=1 remainder=1
1/2= 0 remainder=1
The binary number would be: 11 00 00 00
For 16
16/2=8 remainder=0
8/2=4 remainder=0
4/2=2 remainder=0
2/2=1 remainder=0
1/2= 0 remainder=1
The binary would be: 00 01 00 00
For 3
3/2=1 remainder=1
1/2= 0 remainder=1
The binary would be: 00 00 00 11
For 1
1/2= 0 remainder=1
The binary would be: 00 00 00 01
The binary number would be:
11000000.00010000.00000011.00000001
Answer:
Syntax errors are not able to occur in block based code, so they cannot be transitioned from block to text and can cause issues.
Answer:
a:(allows the different parts of a computer to communicate)
Explanation:
The motherboard is the main command center for the whole pc which recieves your inputs and responds by sending outputs...
