Answer:
See below
Explanation:
Because sometimes you have to 'carry' a 1 over to the ext column when adding two binary numbers
Example :
1 1 1
<u>+1 1 1 </u> <==== starting in the first R column add 1 + 1 to get 0 and carry 1
then the next column you will add 1 + 1 + 1 = 1 and carry 1 again
then 1 + 1 + 1= 1 and carry 1 again (to column 4) to get
1 1 1 0
its less is more A
to much could make it really bad
The answer is 9
Hope I helped you
Answer:
Question users
Explanation:
Q:
Several users on the second floor of your company's building are reporting that the network …
A. Establish a plan of action
B. Question users...
A:
B. Question users
Answer:
Check the explanation
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
what this means is that the size of nut is lesser than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
what this means is that the size of bolt is lesser than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
