Must have
Understand
Today for
Urgent
Answer
List it too
It's not hard
So listen to
Me
Answer:
<em>This program is written in C++</em>
<em>Comment are used to explain difficult lines</em>
<em>The first program that prints 0 to 20 (in decimal) starts here</em>
#include<iostream>
int main()
{
//Print From 0 to 20
for(int i = 0;i<21;i++)
{
std::cout<<i<<'\n';
}
}
<em>The modified program to print 0 to 20 in hexadecimal starts here</em>
#include<iostream>
using namespace std;
int main()
{
//Declare variables to use in conversion;
int tempvar, i=1,remain;
//Declare a char array of length 50 to hold result
char result[50];
//Print 0
cout<<"0"<<endl;
// Iterate from 1 to 20
for(int digit = 1; digit<21; digit++)
{
//Start Conversion Process
//Initialize tempvar to digit (1 to 20)
tempvar = digit;
while(tempvar!=0)
{
//Divide tempvar by 16 and get remainder
remain = tempvar%16;
if(remain<10)
{
result[i++]=remain + 48;
}
else
{
result[i++] = remain + 55;
}
//Get new value of tempvar by dividing it by 16
tempvar/=16;
}
//Print result
for(int l=i-1;l>0;l--)
{
cout<<result[l];
}
i=1;
cout<<endl;
}
return 0;
}
//The Program Ends Here
See Attachments for program 1 and 2; program 2 is the modified version of 1
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark">
cpp
</span>
<span class="sg-text sg-text--link sg-text--bold sg-text--link-disabled sg-text--blue-dark">
cpp
</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:
I do not understand can you type in English?
Explanation:
