<span>A simplified main program used to test functions is called <u><em>formula</em></u>
</span><span />
Answer:
code = 010100000001101000101
Explanation:
Steps:
The inequality yields
, where M = 16. Therefore,
The second step will be to arrange the data bits and check the bits. This will be as follows:
Bit position number Check bits Data Bits
21 10101
20 10100
The bits are checked up to bit position 1
Thus, the code is 010100000001101000101
Answer:
A Program was written to carry out some set activities. below is the code program in C++ in the explanation section
Explanation:
Solution
CODE
#include <iostream>
using namespace std;
int main() {
string name; // variables
int number;
cin >> name >> number; // taking user input
while(number != 0)
{
// printing output
cout << "Eating " << number << " " << name << " a day keeps the doctor away." << endl;
// taking user input again
cin >> name >> number;
}
}
Note: Kindly find an attached copy of the compiled program output to this question.
<span>BCD only goes from digit 0 (0000) to digit 9 (1001), because for 10 you need two digits, so all you've got to do is make a function that produces high for numbers from 10 (1010) to 15 (1111) as follows:
A3 A2 A1 A0 F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
...........................
1 0 0 0 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1
Then simplify the function:
F = A3*A2 + A3*A1
Finally just draw or connect the circuit using NAND</span>