Answer:
its easy
Explanation:
there are are 5 main rules
in binary there are 2 number 0 and 1
0 + 0 = 0
0 + 1 = 1
1+0=1
1+1=0 carry 1
e . g
1 1 1
1 0 1 0 1 0
+ 1 1 0 0 1 0
-------------------------
1 1 1 1 1 0 0
*in bold are the ones that you need to carry.
in decimal there are 10 possible numbers 0- 9
when you do 1 + 9 it becomes 10, this can be done easily, however if you do 1 + 9 in a table like above, you will get 0 for the first column and you will carry 1 to the next column .
in binary is the same idea but using on 2 numbers 1 and 0
e.g
1
1
+ 9
----------
1 0
*in bold are the ones that you need to carry.
hope it helps and good luck in your exam.
Answer: "hierarchy" .
_____________________________________________________
Answer:
See Explaination
Explanation:
#include <iostream>
#include <string.h>
using namespace std;
char *mixem(char *s1, char *s2);
int main() {
cout << mixem("abc", "123") << endl;
cout << mixem("def", "456") << endl;
return 0;
}
char *mixem(char *s1, char *s2) {
char *result = new char[1 + strlen(s1) + strlen(s2)];
char *p1 = s1;
char *p2 = s2;
char *p = result;
while (*p1 || *p2) {
if (*p1) {
*p = *p1;
p1++;
p++;
}
if (*p2) {
*p = *p2;
p2++;
p++;
}
}
*p = '\0';
return result;
}
