Answer:
69
Explanation:
We are given a 1's complement of a number.So to convert it to the original number we have again take the 1's complement of the given 1's complement to convert it to the original number.We can do that by converting all 0's to 1's adn all 1's to 0's.
1's complement= 10111010
original number=01000101
Then to convert the binary number to the decimal number we have multiply each bit with the respective exponent of 2.The exponent of the LSB is 0 and it increases as we move to MSB by 1.
So the calculations are as following:-
(01000101)₂ = (0 × 2⁷) + (1 × 2⁶) + (0 × 2⁵) + (0 × 2⁴) + (0 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) = (69)₁₀
Answer:
Hi!
The correct answer is E.
Explanation:
void change(int ar[], int low, inthigh) {
int temp;
if(low< high) { <em>// here ask if the positions low and high of the array are the same.</em>
temp= ar[low]; <em>// first, saves the element on ar[low] in temp.</em>
ar[low]= ar[high]; <em>// second, the element on ar[high] in ar[low]. First switch.</em>
ar[high]= temp; <em>// third, saves the element on temp in ar[high]. Complete switch.</em>
change(ar,low + 1, high - 1); <em>// Recursive call, adding one position to low, and subtracting one position to high. </em><em>Important: </em><em>When low and high have the same value, the recursive call will finish.</em>
}
}
Result: Switch the lower half of elements in the array with the upper half.
The answer is D. hard drive
Answer:
A
Explanation:
you got to listen if you want to be smart
Hello! I believe the answer for this is "True"!
